./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-1.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_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/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 a1dfcb1c5c2cc6f52bdafead8c203cf19b170f34 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/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 a1dfcb1c5c2cc6f52bdafead8c203cf19b170f34 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:27:26,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:27:26,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:27:26,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:27:26,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:27:26,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:27:26,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:27:26,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:27:26,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:27:26,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:27:26,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:27:26,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:27:26,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:27:26,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:27:26,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:27:26,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:27:26,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:27:26,815 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:27:26,817 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:27:26,819 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:27:26,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:27:26,822 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:27:26,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:27:26,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:27:26,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:27:26,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:27:26,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:27:26,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:27:26,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:27:26,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:27:26,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:27:26,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:27:26,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:27:26,830 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:27:26,830 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:27:26,831 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:27:26,831 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:27:26,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:27:26,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:27:26,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:27:26,833 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:27:26,833 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:27:26,845 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:27:26,845 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:27:26,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:27:26,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:27:26,846 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:27:26,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:27:26,846 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:27:26,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:27:26,847 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:27:26,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:27:26,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:27:26,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:27:26,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:27:26,847 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:27:26,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:27:26,848 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:27:26,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:27:26,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:27:26,848 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:27:26,848 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:27:26,848 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:27:26,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:27:26,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:27:26,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:27:26,849 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:27:26,849 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:27:26,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:27:26,849 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:27:26,850 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:27:26,850 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_e8af2b24-d2e5-4a98-afbf-155202867053/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 -> a1dfcb1c5c2cc6f52bdafead8c203cf19b170f34 [2019-12-07 13:27:26,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:27:26,969 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:27:26,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:27:26,973 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:27:26,973 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:27:26,974 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-1.c [2019-12-07 13:27:27,018 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/data/450ecf006/043e4a95834c4a2aaf7e7e9539ea0689/FLAG618ed7675 [2019-12-07 13:27:27,425 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:27:27,426 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-1.c [2019-12-07 13:27:27,441 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/data/450ecf006/043e4a95834c4a2aaf7e7e9539ea0689/FLAG618ed7675 [2019-12-07 13:27:27,450 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/data/450ecf006/043e4a95834c4a2aaf7e7e9539ea0689 [2019-12-07 13:27:27,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:27:27,453 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:27:27,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:27:27,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:27:27,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:27:27,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:27:27" (1/1) ... [2019-12-07 13:27:27,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8207e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:27, skipping insertion in model container [2019-12-07 13:27:27,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:27:27" (1/1) ... [2019-12-07 13:27:27,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:27:27,500 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:27:27,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:27:27,785 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:27:27,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:27:27,863 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:27:27,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:27 WrapperNode [2019-12-07 13:27:27,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:27:27,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:27:27,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:27:27,865 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:27:27,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:27" (1/1) ... [2019-12-07 13:27:27,887 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:27" (1/1) ... [2019-12-07 13:27:27,918 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:27:27,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:27:27,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:27:27,919 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:27:27,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:27" (1/1) ... [2019-12-07 13:27:27,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:27" (1/1) ... [2019-12-07 13:27:27,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:27" (1/1) ... [2019-12-07 13:27:27,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:27" (1/1) ... [2019-12-07 13:27:27,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:27" (1/1) ... [2019-12-07 13:27:27,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:27" (1/1) ... [2019-12-07 13:27:27,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:27" (1/1) ... [2019-12-07 13:27:27,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:27:27,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:27:27,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:27:27,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:27:27,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:27:28,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 13:27:28,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:27:28,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:27:28,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 13:27:28,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 13:27:28,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 13:27:28,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:27:28,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:27:28,145 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 13:27:28,651 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 13:27:28,651 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 13:27:28,652 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:27:28,652 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 13:27:28,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:27:28 BoogieIcfgContainer [2019-12-07 13:27:28,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:27:28,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:27:28,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:27:28,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:27:28,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:27:27" (1/3) ... [2019-12-07 13:27:28,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d34710b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:27:28, skipping insertion in model container [2019-12-07 13:27:28,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:27" (2/3) ... [2019-12-07 13:27:28,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d34710b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:27:28, skipping insertion in model container [2019-12-07 13:27:28,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:27:28" (3/3) ... [2019-12-07 13:27:28,658 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.08.i.cil-1.c [2019-12-07 13:27:28,665 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:27:28,669 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 13:27:28,677 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 13:27:28,694 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:27:28,694 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:27:28,694 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:27:28,694 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:27:28,694 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:27:28,694 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:27:28,694 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:27:28,694 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:27:28,707 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-12-07 13:27:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 13:27:28,713 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:28,714 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] [2019-12-07 13:27:28,714 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:28,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:28,718 INFO L82 PathProgramCache]: Analyzing trace with hash 62050801, now seen corresponding path program 1 times [2019-12-07 13:27:28,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:28,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56809086] [2019-12-07 13:27:28,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:27:28,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56809086] [2019-12-07 13:27:28,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:28,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:28,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50639113] [2019-12-07 13:27:28,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:28,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:28,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:28,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:28,942 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 4 states. [2019-12-07 13:27:29,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:29,232 INFO L93 Difference]: Finished difference Result 325 states and 551 transitions. [2019-12-07 13:27:29,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:29,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-12-07 13:27:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:29,243 INFO L225 Difference]: With dead ends: 325 [2019-12-07 13:27:29,243 INFO L226 Difference]: Without dead ends: 164 [2019-12-07 13:27:29,246 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 13:27:29,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-07 13:27:29,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2019-12-07 13:27:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-12-07 13:27:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 228 transitions. [2019-12-07 13:27:29,279 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 228 transitions. Word has length 43 [2019-12-07 13:27:29,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:29,279 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 228 transitions. [2019-12-07 13:27:29,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 228 transitions. [2019-12-07 13:27:29,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 13:27:29,281 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:29,282 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] [2019-12-07 13:27:29,282 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:29,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:29,282 INFO L82 PathProgramCache]: Analyzing trace with hash 96450622, now seen corresponding path program 1 times [2019-12-07 13:27:29,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:29,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472360593] [2019-12-07 13:27:29,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:29,359 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 13:27:29,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472360593] [2019-12-07 13:27:29,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:29,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:29,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213292578] [2019-12-07 13:27:29,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:29,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:29,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:29,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:29,362 INFO L87 Difference]: Start difference. First operand 147 states and 228 transitions. Second operand 4 states. [2019-12-07 13:27:29,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:29,584 INFO L93 Difference]: Finished difference Result 292 states and 447 transitions. [2019-12-07 13:27:29,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:29,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 13:27:29,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:29,586 INFO L225 Difference]: With dead ends: 292 [2019-12-07 13:27:29,586 INFO L226 Difference]: Without dead ends: 164 [2019-12-07 13:27:29,588 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 13:27:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-07 13:27:29,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2019-12-07 13:27:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-12-07 13:27:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 227 transitions. [2019-12-07 13:27:29,598 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 227 transitions. Word has length 56 [2019-12-07 13:27:29,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:29,599 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 227 transitions. [2019-12-07 13:27:29,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:29,599 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 227 transitions. [2019-12-07 13:27:29,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 13:27:29,601 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:29,601 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] [2019-12-07 13:27:29,601 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:29,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:29,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1230157520, now seen corresponding path program 1 times [2019-12-07 13:27:29,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:29,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789221638] [2019-12-07 13:27:29,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:29,674 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 13:27:29,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789221638] [2019-12-07 13:27:29,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:29,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:29,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159426856] [2019-12-07 13:27:29,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:29,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:29,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:29,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:29,675 INFO L87 Difference]: Start difference. First operand 147 states and 227 transitions. Second operand 4 states. [2019-12-07 13:27:29,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:29,886 INFO L93 Difference]: Finished difference Result 291 states and 445 transitions. [2019-12-07 13:27:29,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:29,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 13:27:29,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:29,888 INFO L225 Difference]: With dead ends: 291 [2019-12-07 13:27:29,888 INFO L226 Difference]: Without dead ends: 163 [2019-12-07 13:27:29,889 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 13:27:29,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-12-07 13:27:29,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 147. [2019-12-07 13:27:29,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-12-07 13:27:29,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 226 transitions. [2019-12-07 13:27:29,899 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 226 transitions. Word has length 57 [2019-12-07 13:27:29,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:29,899 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 226 transitions. [2019-12-07 13:27:29,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:29,899 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 226 transitions. [2019-12-07 13:27:29,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 13:27:29,901 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:29,901 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] [2019-12-07 13:27:29,901 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:29,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:29,902 INFO L82 PathProgramCache]: Analyzing trace with hash 261723899, now seen corresponding path program 1 times [2019-12-07 13:27:29,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:29,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727829535] [2019-12-07 13:27:29,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:29,961 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 13:27:29,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727829535] [2019-12-07 13:27:29,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:29,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:29,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261215796] [2019-12-07 13:27:29,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:29,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:29,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:29,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:29,962 INFO L87 Difference]: Start difference. First operand 147 states and 226 transitions. Second operand 4 states. [2019-12-07 13:27:30,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:30,149 INFO L93 Difference]: Finished difference Result 289 states and 442 transitions. [2019-12-07 13:27:30,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:30,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 13:27:30,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:30,151 INFO L225 Difference]: With dead ends: 289 [2019-12-07 13:27:30,151 INFO L226 Difference]: Without dead ends: 161 [2019-12-07 13:27:30,151 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 13:27:30,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-12-07 13:27:30,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2019-12-07 13:27:30,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-12-07 13:27:30,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 225 transitions. [2019-12-07 13:27:30,157 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 225 transitions. Word has length 57 [2019-12-07 13:27:30,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:30,158 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 225 transitions. [2019-12-07 13:27:30,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:30,158 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 225 transitions. [2019-12-07 13:27:30,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 13:27:30,159 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:30,159 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] [2019-12-07 13:27:30,159 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:30,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:30,159 INFO L82 PathProgramCache]: Analyzing trace with hash -2030023109, now seen corresponding path program 1 times [2019-12-07 13:27:30,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:30,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503992395] [2019-12-07 13:27:30,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:30,201 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 13:27:30,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503992395] [2019-12-07 13:27:30,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:30,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:30,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067805061] [2019-12-07 13:27:30,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:30,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:30,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:30,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:30,202 INFO L87 Difference]: Start difference. First operand 147 states and 225 transitions. Second operand 4 states. [2019-12-07 13:27:30,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:30,403 INFO L93 Difference]: Finished difference Result 288 states and 440 transitions. [2019-12-07 13:27:30,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:30,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 13:27:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:30,404 INFO L225 Difference]: With dead ends: 288 [2019-12-07 13:27:30,404 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 13:27:30,405 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 13:27:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 13:27:30,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 147. [2019-12-07 13:27:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-12-07 13:27:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 224 transitions. [2019-12-07 13:27:30,409 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 224 transitions. Word has length 57 [2019-12-07 13:27:30,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:30,409 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 224 transitions. [2019-12-07 13:27:30,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:30,409 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 224 transitions. [2019-12-07 13:27:30,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 13:27:30,410 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:30,410 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] [2019-12-07 13:27:30,410 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:30,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:30,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1177906332, now seen corresponding path program 1 times [2019-12-07 13:27:30,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:30,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378642275] [2019-12-07 13:27:30,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:30,447 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 13:27:30,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378642275] [2019-12-07 13:27:30,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:30,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:30,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953631600] [2019-12-07 13:27:30,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:30,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:30,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:30,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:30,449 INFO L87 Difference]: Start difference. First operand 147 states and 224 transitions. Second operand 4 states. [2019-12-07 13:27:30,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:30,627 INFO L93 Difference]: Finished difference Result 288 states and 439 transitions. [2019-12-07 13:27:30,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:30,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 13:27:30,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:30,628 INFO L225 Difference]: With dead ends: 288 [2019-12-07 13:27:30,628 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 13:27:30,629 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 13:27:30,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 13:27:30,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 147. [2019-12-07 13:27:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-12-07 13:27:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 223 transitions. [2019-12-07 13:27:30,633 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 223 transitions. Word has length 57 [2019-12-07 13:27:30,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:30,634 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 223 transitions. [2019-12-07 13:27:30,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 223 transitions. [2019-12-07 13:27:30,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 13:27:30,635 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:30,635 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] [2019-12-07 13:27:30,635 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:30,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:30,635 INFO L82 PathProgramCache]: Analyzing trace with hash -36846841, now seen corresponding path program 1 times [2019-12-07 13:27:30,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:30,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700195242] [2019-12-07 13:27:30,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:30,675 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 13:27:30,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700195242] [2019-12-07 13:27:30,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:30,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:30,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149749780] [2019-12-07 13:27:30,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:30,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:30,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:30,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:30,677 INFO L87 Difference]: Start difference. First operand 147 states and 223 transitions. Second operand 4 states. [2019-12-07 13:27:30,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:30,860 INFO L93 Difference]: Finished difference Result 288 states and 438 transitions. [2019-12-07 13:27:30,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:30,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 13:27:30,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:30,861 INFO L225 Difference]: With dead ends: 288 [2019-12-07 13:27:30,861 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 13:27:30,862 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 13:27:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 13:27:30,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 147. [2019-12-07 13:27:30,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-12-07 13:27:30,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 222 transitions. [2019-12-07 13:27:30,865 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 222 transitions. Word has length 58 [2019-12-07 13:27:30,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:30,865 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 222 transitions. [2019-12-07 13:27:30,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:30,865 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2019-12-07 13:27:30,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 13:27:30,866 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:30,866 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] [2019-12-07 13:27:30,866 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:30,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:30,866 INFO L82 PathProgramCache]: Analyzing trace with hash -2053945591, now seen corresponding path program 1 times [2019-12-07 13:27:30,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:30,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520984702] [2019-12-07 13:27:30,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:30,898 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 13:27:30,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520984702] [2019-12-07 13:27:30,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:30,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:30,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547168935] [2019-12-07 13:27:30,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:30,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:30,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:30,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:30,899 INFO L87 Difference]: Start difference. First operand 147 states and 222 transitions. Second operand 4 states. [2019-12-07 13:27:31,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:31,094 INFO L93 Difference]: Finished difference Result 288 states and 437 transitions. [2019-12-07 13:27:31,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:31,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 13:27:31,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:31,096 INFO L225 Difference]: With dead ends: 288 [2019-12-07 13:27:31,096 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 13:27:31,096 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 13:27:31,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 13:27:31,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 147. [2019-12-07 13:27:31,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-12-07 13:27:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 221 transitions. [2019-12-07 13:27:31,101 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 221 transitions. Word has length 59 [2019-12-07 13:27:31,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:31,101 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 221 transitions. [2019-12-07 13:27:31,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:31,101 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 221 transitions. [2019-12-07 13:27:31,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 13:27:31,102 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:31,102 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] [2019-12-07 13:27:31,102 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:31,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:31,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1105265292, now seen corresponding path program 1 times [2019-12-07 13:27:31,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:31,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373341524] [2019-12-07 13:27:31,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:31,142 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 13:27:31,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373341524] [2019-12-07 13:27:31,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:31,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:31,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366216072] [2019-12-07 13:27:31,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:31,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:31,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:31,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:31,143 INFO L87 Difference]: Start difference. First operand 147 states and 221 transitions. Second operand 4 states. [2019-12-07 13:27:31,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:31,300 INFO L93 Difference]: Finished difference Result 278 states and 423 transitions. [2019-12-07 13:27:31,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:31,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 13:27:31,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:31,301 INFO L225 Difference]: With dead ends: 278 [2019-12-07 13:27:31,301 INFO L226 Difference]: Without dead ends: 150 [2019-12-07 13:27:31,301 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 13:27:31,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-12-07 13:27:31,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2019-12-07 13:27:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-12-07 13:27:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 220 transitions. [2019-12-07 13:27:31,304 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 220 transitions. Word has length 60 [2019-12-07 13:27:31,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:31,304 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 220 transitions. [2019-12-07 13:27:31,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:31,305 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 220 transitions. [2019-12-07 13:27:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 13:27:31,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:31,305 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] [2019-12-07 13:27:31,305 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:31,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:31,306 INFO L82 PathProgramCache]: Analyzing trace with hash 493391860, now seen corresponding path program 1 times [2019-12-07 13:27:31,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:31,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410307622] [2019-12-07 13:27:31,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:31,335 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 13:27:31,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410307622] [2019-12-07 13:27:31,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:31,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:31,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126788458] [2019-12-07 13:27:31,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:31,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:31,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:31,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:31,336 INFO L87 Difference]: Start difference. First operand 147 states and 220 transitions. Second operand 4 states. [2019-12-07 13:27:31,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:31,534 INFO L93 Difference]: Finished difference Result 318 states and 484 transitions. [2019-12-07 13:27:31,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:31,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 13:27:31,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:31,536 INFO L225 Difference]: With dead ends: 318 [2019-12-07 13:27:31,536 INFO L226 Difference]: Without dead ends: 190 [2019-12-07 13:27:31,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:27:31,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-12-07 13:27:31,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 169. [2019-12-07 13:27:31,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-07 13:27:31,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 258 transitions. [2019-12-07 13:27:31,542 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 258 transitions. Word has length 60 [2019-12-07 13:27:31,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:31,542 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 258 transitions. [2019-12-07 13:27:31,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:31,543 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 258 transitions. [2019-12-07 13:27:31,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 13:27:31,543 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:31,544 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] [2019-12-07 13:27:31,544 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:31,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:31,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1533548315, now seen corresponding path program 1 times [2019-12-07 13:27:31,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:31,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024093556] [2019-12-07 13:27:31,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:31,587 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 13:27:31,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024093556] [2019-12-07 13:27:31,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:31,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:31,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962083804] [2019-12-07 13:27:31,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:31,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:31,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:31,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:31,588 INFO L87 Difference]: Start difference. First operand 169 states and 258 transitions. Second operand 4 states. [2019-12-07 13:27:31,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:31,802 INFO L93 Difference]: Finished difference Result 340 states and 521 transitions. [2019-12-07 13:27:31,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:31,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 13:27:31,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:31,803 INFO L225 Difference]: With dead ends: 340 [2019-12-07 13:27:31,803 INFO L226 Difference]: Without dead ends: 190 [2019-12-07 13:27:31,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:27:31,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-12-07 13:27:31,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 169. [2019-12-07 13:27:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-07 13:27:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 257 transitions. [2019-12-07 13:27:31,808 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 257 transitions. Word has length 73 [2019-12-07 13:27:31,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:31,808 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 257 transitions. [2019-12-07 13:27:31,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:31,808 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 257 transitions. [2019-12-07 13:27:31,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 13:27:31,809 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:31,809 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] [2019-12-07 13:27:31,809 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:31,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:31,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1464454253, now seen corresponding path program 1 times [2019-12-07 13:27:31,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:31,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937183581] [2019-12-07 13:27:31,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:31,845 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 13:27:31,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937183581] [2019-12-07 13:27:31,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:31,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:31,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763297570] [2019-12-07 13:27:31,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:31,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:31,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:31,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:31,847 INFO L87 Difference]: Start difference. First operand 169 states and 257 transitions. Second operand 4 states. [2019-12-07 13:27:32,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:32,075 INFO L93 Difference]: Finished difference Result 339 states and 518 transitions. [2019-12-07 13:27:32,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:32,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 13:27:32,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:32,076 INFO L225 Difference]: With dead ends: 339 [2019-12-07 13:27:32,076 INFO L226 Difference]: Without dead ends: 189 [2019-12-07 13:27:32,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:27:32,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-12-07 13:27:32,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 169. [2019-12-07 13:27:32,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-07 13:27:32,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 256 transitions. [2019-12-07 13:27:32,080 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 256 transitions. Word has length 74 [2019-12-07 13:27:32,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:32,080 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 256 transitions. [2019-12-07 13:27:32,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:32,080 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 256 transitions. [2019-12-07 13:27:32,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 13:27:32,081 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:32,081 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] [2019-12-07 13:27:32,081 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:32,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:32,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1862079422, now seen corresponding path program 1 times [2019-12-07 13:27:32,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:32,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814018135] [2019-12-07 13:27:32,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:32,110 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 13:27:32,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814018135] [2019-12-07 13:27:32,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:32,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:32,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676297951] [2019-12-07 13:27:32,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:32,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:32,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:32,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:32,111 INFO L87 Difference]: Start difference. First operand 169 states and 256 transitions. Second operand 4 states. [2019-12-07 13:27:32,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:32,332 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-12-07 13:27:32,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:32,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 13:27:32,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:32,334 INFO L225 Difference]: With dead ends: 337 [2019-12-07 13:27:32,334 INFO L226 Difference]: Without dead ends: 187 [2019-12-07 13:27:32,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:27:32,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-12-07 13:27:32,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 169. [2019-12-07 13:27:32,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-07 13:27:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 255 transitions. [2019-12-07 13:27:32,338 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 255 transitions. Word has length 74 [2019-12-07 13:27:32,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:32,338 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 255 transitions. [2019-12-07 13:27:32,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 255 transitions. [2019-12-07 13:27:32,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 13:27:32,339 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:32,339 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] [2019-12-07 13:27:32,339 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:32,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:32,339 INFO L82 PathProgramCache]: Analyzing trace with hash -429667586, now seen corresponding path program 1 times [2019-12-07 13:27:32,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:32,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232467781] [2019-12-07 13:27:32,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:32,370 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 13:27:32,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232467781] [2019-12-07 13:27:32,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:32,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:32,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099487627] [2019-12-07 13:27:32,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:32,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:32,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:32,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:32,371 INFO L87 Difference]: Start difference. First operand 169 states and 255 transitions. Second operand 4 states. [2019-12-07 13:27:32,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:32,598 INFO L93 Difference]: Finished difference Result 336 states and 511 transitions. [2019-12-07 13:27:32,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:32,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 13:27:32,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:32,599 INFO L225 Difference]: With dead ends: 336 [2019-12-07 13:27:32,599 INFO L226 Difference]: Without dead ends: 186 [2019-12-07 13:27:32,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:27:32,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-07 13:27:32,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 169. [2019-12-07 13:27:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-07 13:27:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 254 transitions. [2019-12-07 13:27:32,604 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 254 transitions. Word has length 74 [2019-12-07 13:27:32,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:32,604 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 254 transitions. [2019-12-07 13:27:32,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:32,604 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 254 transitions. [2019-12-07 13:27:32,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 13:27:32,605 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:32,605 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] [2019-12-07 13:27:32,605 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:32,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:32,606 INFO L82 PathProgramCache]: Analyzing trace with hash 422449191, now seen corresponding path program 1 times [2019-12-07 13:27:32,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:32,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860802743] [2019-12-07 13:27:32,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:32,638 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 13:27:32,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860802743] [2019-12-07 13:27:32,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:32,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:32,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309053867] [2019-12-07 13:27:32,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:32,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:32,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:32,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:32,640 INFO L87 Difference]: Start difference. First operand 169 states and 254 transitions. Second operand 4 states. [2019-12-07 13:27:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:32,850 INFO L93 Difference]: Finished difference Result 336 states and 509 transitions. [2019-12-07 13:27:32,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:32,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 13:27:32,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:32,852 INFO L225 Difference]: With dead ends: 336 [2019-12-07 13:27:32,852 INFO L226 Difference]: Without dead ends: 186 [2019-12-07 13:27:32,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:27:32,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-07 13:27:32,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 169. [2019-12-07 13:27:32,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-07 13:27:32,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 253 transitions. [2019-12-07 13:27:32,857 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 253 transitions. Word has length 74 [2019-12-07 13:27:32,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:32,858 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 253 transitions. [2019-12-07 13:27:32,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:32,858 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 253 transitions. [2019-12-07 13:27:32,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 13:27:32,858 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:32,859 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] [2019-12-07 13:27:32,859 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:32,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:32,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1965433180, now seen corresponding path program 1 times [2019-12-07 13:27:32,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:32,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438492981] [2019-12-07 13:27:32,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:32,891 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 13:27:32,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438492981] [2019-12-07 13:27:32,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:32,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:32,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324141840] [2019-12-07 13:27:32,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:32,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:32,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:32,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:32,893 INFO L87 Difference]: Start difference. First operand 169 states and 253 transitions. Second operand 4 states. [2019-12-07 13:27:33,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:33,107 INFO L93 Difference]: Finished difference Result 336 states and 507 transitions. [2019-12-07 13:27:33,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:33,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 13:27:33,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:33,109 INFO L225 Difference]: With dead ends: 336 [2019-12-07 13:27:33,109 INFO L226 Difference]: Without dead ends: 186 [2019-12-07 13:27:33,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:27:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-07 13:27:33,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 169. [2019-12-07 13:27:33,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-07 13:27:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 252 transitions. [2019-12-07 13:27:33,112 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 252 transitions. Word has length 75 [2019-12-07 13:27:33,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:33,112 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 252 transitions. [2019-12-07 13:27:33,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:33,113 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 252 transitions. [2019-12-07 13:27:33,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 13:27:33,113 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:33,113 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] [2019-12-07 13:27:33,113 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:33,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:33,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1710579956, now seen corresponding path program 1 times [2019-12-07 13:27:33,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:33,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691906959] [2019-12-07 13:27:33,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:33,138 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 13:27:33,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691906959] [2019-12-07 13:27:33,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:33,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:33,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459474279] [2019-12-07 13:27:33,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:33,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:33,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:33,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:33,139 INFO L87 Difference]: Start difference. First operand 169 states and 252 transitions. Second operand 4 states. [2019-12-07 13:27:33,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:33,317 INFO L93 Difference]: Finished difference Result 336 states and 505 transitions. [2019-12-07 13:27:33,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:33,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 13:27:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:33,318 INFO L225 Difference]: With dead ends: 336 [2019-12-07 13:27:33,318 INFO L226 Difference]: Without dead ends: 186 [2019-12-07 13:27:33,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:27:33,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-07 13:27:33,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 169. [2019-12-07 13:27:33,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-07 13:27:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 251 transitions. [2019-12-07 13:27:33,321 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 251 transitions. Word has length 76 [2019-12-07 13:27:33,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:33,322 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 251 transitions. [2019-12-07 13:27:33,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 251 transitions. [2019-12-07 13:27:33,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 13:27:33,322 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:33,322 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] [2019-12-07 13:27:33,322 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:33,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:33,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1135301911, now seen corresponding path program 1 times [2019-12-07 13:27:33,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:33,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527939498] [2019-12-07 13:27:33,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:33,350 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 13:27:33,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527939498] [2019-12-07 13:27:33,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:33,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:33,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135108264] [2019-12-07 13:27:33,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:33,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:33,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:33,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:33,351 INFO L87 Difference]: Start difference. First operand 169 states and 251 transitions. Second operand 4 states. [2019-12-07 13:27:33,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:33,529 INFO L93 Difference]: Finished difference Result 326 states and 490 transitions. [2019-12-07 13:27:33,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:33,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-07 13:27:33,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:33,530 INFO L225 Difference]: With dead ends: 326 [2019-12-07 13:27:33,530 INFO L226 Difference]: Without dead ends: 176 [2019-12-07 13:27:33,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:27:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-12-07 13:27:33,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 169. [2019-12-07 13:27:33,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-07 13:27:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 250 transitions. [2019-12-07 13:27:33,533 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 250 transitions. Word has length 77 [2019-12-07 13:27:33,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:33,534 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 250 transitions. [2019-12-07 13:27:33,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:33,534 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 250 transitions. [2019-12-07 13:27:33,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 13:27:33,534 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:33,534 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:33,534 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:33,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:33,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1507827117, now seen corresponding path program 1 times [2019-12-07 13:27:33,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:33,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713576682] [2019-12-07 13:27:33,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:33,576 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 13:27:33,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713576682] [2019-12-07 13:27:33,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:33,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:33,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046182144] [2019-12-07 13:27:33,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:33,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:33,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:33,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:33,577 INFO L87 Difference]: Start difference. First operand 169 states and 250 transitions. Second operand 4 states. [2019-12-07 13:27:33,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:33,888 INFO L93 Difference]: Finished difference Result 427 states and 645 transitions. [2019-12-07 13:27:33,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:33,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-12-07 13:27:33,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:33,889 INFO L225 Difference]: With dead ends: 427 [2019-12-07 13:27:33,889 INFO L226 Difference]: Without dead ends: 277 [2019-12-07 13:27:33,890 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 13:27:33,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-12-07 13:27:33,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 210. [2019-12-07 13:27:33,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-12-07 13:27:33,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 324 transitions. [2019-12-07 13:27:33,894 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 324 transitions. Word has length 82 [2019-12-07 13:27:33,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:33,894 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 324 transitions. [2019-12-07 13:27:33,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:33,894 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 324 transitions. [2019-12-07 13:27:33,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 13:27:33,894 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:33,895 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:33,895 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:33,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:33,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1931473839, now seen corresponding path program 1 times [2019-12-07 13:27:33,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:33,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357738586] [2019-12-07 13:27:33,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:33,929 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 13:27:33,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357738586] [2019-12-07 13:27:33,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:33,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:33,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601628059] [2019-12-07 13:27:33,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:33,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:33,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:33,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:33,930 INFO L87 Difference]: Start difference. First operand 210 states and 324 transitions. Second operand 4 states. [2019-12-07 13:27:34,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:34,206 INFO L93 Difference]: Finished difference Result 450 states and 701 transitions. [2019-12-07 13:27:34,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:34,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-12-07 13:27:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:34,208 INFO L225 Difference]: With dead ends: 450 [2019-12-07 13:27:34,208 INFO L226 Difference]: Without dead ends: 259 [2019-12-07 13:27:34,209 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 13:27:34,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-12-07 13:27:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 234. [2019-12-07 13:27:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 13:27:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 366 transitions. [2019-12-07 13:27:34,214 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 366 transitions. Word has length 82 [2019-12-07 13:27:34,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:34,214 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 366 transitions. [2019-12-07 13:27:34,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:34,214 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 366 transitions. [2019-12-07 13:27:34,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 13:27:34,215 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:34,215 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 13:27:34,215 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:34,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:34,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1813377491, now seen corresponding path program 1 times [2019-12-07 13:27:34,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:34,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903492165] [2019-12-07 13:27:34,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:34,265 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 13:27:34,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903492165] [2019-12-07 13:27:34,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:34,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:34,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372641132] [2019-12-07 13:27:34,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:34,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:34,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:34,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:34,266 INFO L87 Difference]: Start difference. First operand 234 states and 366 transitions. Second operand 4 states. [2019-12-07 13:27:34,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:34,548 INFO L93 Difference]: Finished difference Result 508 states and 791 transitions. [2019-12-07 13:27:34,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:34,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-12-07 13:27:34,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:34,550 INFO L225 Difference]: With dead ends: 508 [2019-12-07 13:27:34,550 INFO L226 Difference]: Without dead ends: 293 [2019-12-07 13:27:34,551 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 13:27:34,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-12-07 13:27:34,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 235. [2019-12-07 13:27:34,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-07 13:27:34,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 367 transitions. [2019-12-07 13:27:34,554 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 367 transitions. Word has length 83 [2019-12-07 13:27:34,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:34,554 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 367 transitions. [2019-12-07 13:27:34,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:34,554 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 367 transitions. [2019-12-07 13:27:34,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 13:27:34,555 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:34,555 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] [2019-12-07 13:27:34,555 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:34,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:34,555 INFO L82 PathProgramCache]: Analyzing trace with hash -724247038, now seen corresponding path program 1 times [2019-12-07 13:27:34,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:34,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291243685] [2019-12-07 13:27:34,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:34,591 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 13:27:34,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291243685] [2019-12-07 13:27:34,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:34,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:34,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920309332] [2019-12-07 13:27:34,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:34,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:34,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:34,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:34,592 INFO L87 Difference]: Start difference. First operand 235 states and 367 transitions. Second operand 4 states. [2019-12-07 13:27:34,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:34,852 INFO L93 Difference]: Finished difference Result 509 states and 791 transitions. [2019-12-07 13:27:34,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:34,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 13:27:34,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:34,853 INFO L225 Difference]: With dead ends: 509 [2019-12-07 13:27:34,853 INFO L226 Difference]: Without dead ends: 293 [2019-12-07 13:27:34,854 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 13:27:34,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-12-07 13:27:34,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 235. [2019-12-07 13:27:34,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-07 13:27:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 366 transitions. [2019-12-07 13:27:34,857 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 366 transitions. Word has length 95 [2019-12-07 13:27:34,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:34,858 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 366 transitions. [2019-12-07 13:27:34,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:34,858 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 366 transitions. [2019-12-07 13:27:34,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 13:27:34,858 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:34,858 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] [2019-12-07 13:27:34,858 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:34,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:34,859 INFO L82 PathProgramCache]: Analyzing trace with hash 151771968, now seen corresponding path program 1 times [2019-12-07 13:27:34,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:34,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600039196] [2019-12-07 13:27:34,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:34,891 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 13:27:34,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600039196] [2019-12-07 13:27:34,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:34,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:34,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387927278] [2019-12-07 13:27:34,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:34,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:34,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:34,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:34,892 INFO L87 Difference]: Start difference. First operand 235 states and 366 transitions. Second operand 4 states. [2019-12-07 13:27:35,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:35,107 INFO L93 Difference]: Finished difference Result 476 states and 742 transitions. [2019-12-07 13:27:35,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:35,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 13:27:35,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:35,108 INFO L225 Difference]: With dead ends: 476 [2019-12-07 13:27:35,109 INFO L226 Difference]: Without dead ends: 260 [2019-12-07 13:27:35,109 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 13:27:35,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-12-07 13:27:35,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 235. [2019-12-07 13:27:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-07 13:27:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 365 transitions. [2019-12-07 13:27:35,114 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 365 transitions. Word has length 95 [2019-12-07 13:27:35,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:35,114 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 365 transitions. [2019-12-07 13:27:35,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:35,115 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 365 transitions. [2019-12-07 13:27:35,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 13:27:35,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:35,115 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] [2019-12-07 13:27:35,116 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:35,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:35,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1558333836, now seen corresponding path program 1 times [2019-12-07 13:27:35,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:35,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827677041] [2019-12-07 13:27:35,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:35,156 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 13:27:35,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827677041] [2019-12-07 13:27:35,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:35,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:35,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288205958] [2019-12-07 13:27:35,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:35,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:35,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:35,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:35,157 INFO L87 Difference]: Start difference. First operand 235 states and 365 transitions. Second operand 4 states. [2019-12-07 13:27:35,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:35,457 INFO L93 Difference]: Finished difference Result 508 states and 786 transitions. [2019-12-07 13:27:35,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:35,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 13:27:35,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:35,459 INFO L225 Difference]: With dead ends: 508 [2019-12-07 13:27:35,459 INFO L226 Difference]: Without dead ends: 292 [2019-12-07 13:27:35,460 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 13:27:35,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-12-07 13:27:35,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 235. [2019-12-07 13:27:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-07 13:27:35,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 364 transitions. [2019-12-07 13:27:35,464 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 364 transitions. Word has length 96 [2019-12-07 13:27:35,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:35,464 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 364 transitions. [2019-12-07 13:27:35,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 364 transitions. [2019-12-07 13:27:35,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 13:27:35,464 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:35,465 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] [2019-12-07 13:27:35,465 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:35,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:35,465 INFO L82 PathProgramCache]: Analyzing trace with hash 589900215, now seen corresponding path program 1 times [2019-12-07 13:27:35,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:35,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463344468] [2019-12-07 13:27:35,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:35,502 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 13:27:35,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463344468] [2019-12-07 13:27:35,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:35,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:35,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570861889] [2019-12-07 13:27:35,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:35,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:35,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:35,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:35,503 INFO L87 Difference]: Start difference. First operand 235 states and 364 transitions. Second operand 4 states. [2019-12-07 13:27:35,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:35,796 INFO L93 Difference]: Finished difference Result 506 states and 782 transitions. [2019-12-07 13:27:35,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:35,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 13:27:35,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:35,798 INFO L225 Difference]: With dead ends: 506 [2019-12-07 13:27:35,807 INFO L226 Difference]: Without dead ends: 290 [2019-12-07 13:27:35,807 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 13:27:35,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-12-07 13:27:35,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 235. [2019-12-07 13:27:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-07 13:27:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 363 transitions. [2019-12-07 13:27:35,812 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 363 transitions. Word has length 96 [2019-12-07 13:27:35,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:35,813 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 363 transitions. [2019-12-07 13:27:35,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:35,813 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 363 transitions. [2019-12-07 13:27:35,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 13:27:35,813 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:35,814 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] [2019-12-07 13:27:35,814 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:35,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:35,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1701846793, now seen corresponding path program 1 times [2019-12-07 13:27:35,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:35,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916444463] [2019-12-07 13:27:35,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:35,856 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 13:27:35,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916444463] [2019-12-07 13:27:35,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:35,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:35,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208635388] [2019-12-07 13:27:35,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:35,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:35,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:35,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:35,857 INFO L87 Difference]: Start difference. First operand 235 states and 363 transitions. Second operand 4 states. [2019-12-07 13:27:36,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:36,119 INFO L93 Difference]: Finished difference Result 505 states and 779 transitions. [2019-12-07 13:27:36,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:36,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 13:27:36,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:36,121 INFO L225 Difference]: With dead ends: 505 [2019-12-07 13:27:36,121 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 13:27:36,121 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 13:27:36,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 13:27:36,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 235. [2019-12-07 13:27:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-07 13:27:36,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 362 transitions. [2019-12-07 13:27:36,124 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 362 transitions. Word has length 96 [2019-12-07 13:27:36,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:36,125 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 362 transitions. [2019-12-07 13:27:36,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:36,125 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 362 transitions. [2019-12-07 13:27:36,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 13:27:36,125 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:36,125 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:36,125 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:36,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:36,126 INFO L82 PathProgramCache]: Analyzing trace with hash -849730016, now seen corresponding path program 1 times [2019-12-07 13:27:36,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:36,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605551635] [2019-12-07 13:27:36,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:36,167 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 13:27:36,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605551635] [2019-12-07 13:27:36,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:36,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:27:36,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755881980] [2019-12-07 13:27:36,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:27:36,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:36,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:27:36,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:27:36,168 INFO L87 Difference]: Start difference. First operand 235 states and 362 transitions. Second operand 5 states. [2019-12-07 13:27:36,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:36,457 INFO L93 Difference]: Finished difference Result 472 states and 732 transitions. [2019-12-07 13:27:36,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:27:36,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-07 13:27:36,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:36,458 INFO L225 Difference]: With dead ends: 472 [2019-12-07 13:27:36,458 INFO L226 Difference]: Without dead ends: 256 [2019-12-07 13:27:36,459 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 13:27:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-12-07 13:27:36,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 255. [2019-12-07 13:27:36,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-12-07 13:27:36,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 388 transitions. [2019-12-07 13:27:36,464 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 388 transitions. Word has length 96 [2019-12-07 13:27:36,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:36,464 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 388 transitions. [2019-12-07 13:27:36,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:27:36,464 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 388 transitions. [2019-12-07 13:27:36,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 13:27:36,465 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:36,465 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] [2019-12-07 13:27:36,465 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:36,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:36,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1976685625, now seen corresponding path program 1 times [2019-12-07 13:27:36,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:36,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807326965] [2019-12-07 13:27:36,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:36,506 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 13:27:36,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807326965] [2019-12-07 13:27:36,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:36,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:36,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807773180] [2019-12-07 13:27:36,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:36,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:36,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:36,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:36,507 INFO L87 Difference]: Start difference. First operand 255 states and 388 transitions. Second operand 4 states. [2019-12-07 13:27:36,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:36,699 INFO L93 Difference]: Finished difference Result 513 states and 782 transitions. [2019-12-07 13:27:36,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:36,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 13:27:36,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:36,701 INFO L225 Difference]: With dead ends: 513 [2019-12-07 13:27:36,701 INFO L226 Difference]: Without dead ends: 277 [2019-12-07 13:27:36,701 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 13:27:36,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-12-07 13:27:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 255. [2019-12-07 13:27:36,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-12-07 13:27:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 387 transitions. [2019-12-07 13:27:36,705 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 387 transitions. Word has length 96 [2019-12-07 13:27:36,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:36,705 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 387 transitions. [2019-12-07 13:27:36,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:36,705 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 387 transitions. [2019-12-07 13:27:36,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 13:27:36,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:36,706 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] [2019-12-07 13:27:36,706 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:36,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:36,706 INFO L82 PathProgramCache]: Analyzing trace with hash -315061383, now seen corresponding path program 1 times [2019-12-07 13:27:36,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:36,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349269991] [2019-12-07 13:27:36,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:36,739 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 13:27:36,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349269991] [2019-12-07 13:27:36,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:36,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:36,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891071824] [2019-12-07 13:27:36,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:36,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:36,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:36,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:36,740 INFO L87 Difference]: Start difference. First operand 255 states and 387 transitions. Second operand 4 states. [2019-12-07 13:27:36,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:36,957 INFO L93 Difference]: Finished difference Result 512 states and 779 transitions. [2019-12-07 13:27:36,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:36,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 13:27:36,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:36,959 INFO L225 Difference]: With dead ends: 512 [2019-12-07 13:27:36,959 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 13:27:36,960 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 13:27:36,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 13:27:36,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 255. [2019-12-07 13:27:36,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-12-07 13:27:36,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 386 transitions. [2019-12-07 13:27:36,967 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 386 transitions. Word has length 96 [2019-12-07 13:27:36,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:36,967 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 386 transitions. [2019-12-07 13:27:36,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:36,967 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 386 transitions. [2019-12-07 13:27:36,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 13:27:36,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:36,968 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 13:27:36,968 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:36,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:36,969 INFO L82 PathProgramCache]: Analyzing trace with hash -2085923458, now seen corresponding path program 1 times [2019-12-07 13:27:36,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:36,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334522552] [2019-12-07 13:27:36,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:37,007 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 13:27:37,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334522552] [2019-12-07 13:27:37,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:37,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:37,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538242635] [2019-12-07 13:27:37,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:37,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:37,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:37,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:37,009 INFO L87 Difference]: Start difference. First operand 255 states and 386 transitions. Second operand 4 states. [2019-12-07 13:27:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:37,272 INFO L93 Difference]: Finished difference Result 545 states and 824 transitions. [2019-12-07 13:27:37,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:37,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 13:27:37,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:37,274 INFO L225 Difference]: With dead ends: 545 [2019-12-07 13:27:37,274 INFO L226 Difference]: Without dead ends: 309 [2019-12-07 13:27:37,274 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 13:27:37,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-12-07 13:27:37,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 255. [2019-12-07 13:27:37,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-12-07 13:27:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 385 transitions. [2019-12-07 13:27:37,278 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 385 transitions. Word has length 97 [2019-12-07 13:27:37,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:37,278 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 385 transitions. [2019-12-07 13:27:37,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:37,278 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 385 transitions. [2019-12-07 13:27:37,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 13:27:37,279 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:37,279 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 13:27:37,279 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:37,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:37,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2045248708, now seen corresponding path program 1 times [2019-12-07 13:27:37,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:37,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721565177] [2019-12-07 13:27:37,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:37,310 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 13:27:37,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721565177] [2019-12-07 13:27:37,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:37,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:37,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310719368] [2019-12-07 13:27:37,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:37,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:37,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:37,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:37,311 INFO L87 Difference]: Start difference. First operand 255 states and 385 transitions. Second operand 4 states. [2019-12-07 13:27:37,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:37,537 INFO L93 Difference]: Finished difference Result 512 states and 775 transitions. [2019-12-07 13:27:37,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:37,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 13:27:37,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:37,538 INFO L225 Difference]: With dead ends: 512 [2019-12-07 13:27:37,538 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 13:27:37,539 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 13:27:37,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 13:27:37,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 255. [2019-12-07 13:27:37,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-12-07 13:27:37,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 384 transitions. [2019-12-07 13:27:37,543 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 384 transitions. Word has length 97 [2019-12-07 13:27:37,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:37,543 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 384 transitions. [2019-12-07 13:27:37,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:37,543 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 384 transitions. [2019-12-07 13:27:37,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 13:27:37,543 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:37,544 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] [2019-12-07 13:27:37,544 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:37,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:37,544 INFO L82 PathProgramCache]: Analyzing trace with hash -811521741, now seen corresponding path program 1 times [2019-12-07 13:27:37,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:37,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059994276] [2019-12-07 13:27:37,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:37,574 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 13:27:37,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059994276] [2019-12-07 13:27:37,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:37,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:37,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590356649] [2019-12-07 13:27:37,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:37,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:37,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:37,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:37,575 INFO L87 Difference]: Start difference. First operand 255 states and 384 transitions. Second operand 4 states. [2019-12-07 13:27:37,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:37,827 INFO L93 Difference]: Finished difference Result 545 states and 820 transitions. [2019-12-07 13:27:37,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:37,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 13:27:37,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:37,829 INFO L225 Difference]: With dead ends: 545 [2019-12-07 13:27:37,829 INFO L226 Difference]: Without dead ends: 309 [2019-12-07 13:27:37,829 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 13:27:37,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-12-07 13:27:37,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 255. [2019-12-07 13:27:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-12-07 13:27:37,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 383 transitions. [2019-12-07 13:27:37,833 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 383 transitions. Word has length 98 [2019-12-07 13:27:37,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:37,833 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 383 transitions. [2019-12-07 13:27:37,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:37,833 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 383 transitions. [2019-12-07 13:27:37,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 13:27:37,834 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:37,834 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] [2019-12-07 13:27:37,834 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:37,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:37,834 INFO L82 PathProgramCache]: Analyzing trace with hash 449395509, now seen corresponding path program 1 times [2019-12-07 13:27:37,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:37,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408871340] [2019-12-07 13:27:37,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:37,864 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 13:27:37,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408871340] [2019-12-07 13:27:37,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:37,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:37,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797193453] [2019-12-07 13:27:37,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:37,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:37,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:37,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:37,865 INFO L87 Difference]: Start difference. First operand 255 states and 383 transitions. Second operand 4 states. [2019-12-07 13:27:38,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:38,062 INFO L93 Difference]: Finished difference Result 512 states and 771 transitions. [2019-12-07 13:27:38,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:38,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 13:27:38,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:38,064 INFO L225 Difference]: With dead ends: 512 [2019-12-07 13:27:38,064 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 13:27:38,064 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 13:27:38,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 13:27:38,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 255. [2019-12-07 13:27:38,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-12-07 13:27:38,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 382 transitions. [2019-12-07 13:27:38,068 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 382 transitions. Word has length 98 [2019-12-07 13:27:38,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:38,068 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 382 transitions. [2019-12-07 13:27:38,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:38,068 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 382 transitions. [2019-12-07 13:27:38,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 13:27:38,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:38,069 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] [2019-12-07 13:27:38,069 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:38,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:38,069 INFO L82 PathProgramCache]: Analyzing trace with hash 593163641, now seen corresponding path program 1 times [2019-12-07 13:27:38,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:38,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474169645] [2019-12-07 13:27:38,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:38,099 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 13:27:38,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474169645] [2019-12-07 13:27:38,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:38,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:38,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163330395] [2019-12-07 13:27:38,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:38,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:38,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:38,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:38,100 INFO L87 Difference]: Start difference. First operand 255 states and 382 transitions. Second operand 4 states. [2019-12-07 13:27:38,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:38,351 INFO L93 Difference]: Finished difference Result 545 states and 816 transitions. [2019-12-07 13:27:38,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:38,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 13:27:38,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:38,353 INFO L225 Difference]: With dead ends: 545 [2019-12-07 13:27:38,353 INFO L226 Difference]: Without dead ends: 309 [2019-12-07 13:27:38,353 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 13:27:38,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-12-07 13:27:38,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 255. [2019-12-07 13:27:38,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-12-07 13:27:38,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 381 transitions. [2019-12-07 13:27:38,358 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 381 transitions. Word has length 99 [2019-12-07 13:27:38,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:38,358 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 381 transitions. [2019-12-07 13:27:38,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:38,358 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 381 transitions. [2019-12-07 13:27:38,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 13:27:38,359 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:38,359 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] [2019-12-07 13:27:38,359 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:38,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:38,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1026892727, now seen corresponding path program 1 times [2019-12-07 13:27:38,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:38,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289947478] [2019-12-07 13:27:38,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:38,391 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 13:27:38,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289947478] [2019-12-07 13:27:38,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:38,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:38,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161742427] [2019-12-07 13:27:38,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:38,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:38,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:38,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:38,392 INFO L87 Difference]: Start difference. First operand 255 states and 381 transitions. Second operand 4 states. [2019-12-07 13:27:38,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:38,591 INFO L93 Difference]: Finished difference Result 512 states and 767 transitions. [2019-12-07 13:27:38,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:38,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 13:27:38,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:38,593 INFO L225 Difference]: With dead ends: 512 [2019-12-07 13:27:38,593 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 13:27:38,593 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 13:27:38,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 13:27:38,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 255. [2019-12-07 13:27:38,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-12-07 13:27:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 380 transitions. [2019-12-07 13:27:38,598 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 380 transitions. Word has length 99 [2019-12-07 13:27:38,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:38,598 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 380 transitions. [2019-12-07 13:27:38,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:38,598 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 380 transitions. [2019-12-07 13:27:38,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 13:27:38,599 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:38,599 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] [2019-12-07 13:27:38,599 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:38,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:38,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1741675342, now seen corresponding path program 1 times [2019-12-07 13:27:38,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:38,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133090620] [2019-12-07 13:27:38,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:38,633 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 13:27:38,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133090620] [2019-12-07 13:27:38,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:38,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:38,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111880565] [2019-12-07 13:27:38,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:38,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:38,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:38,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:38,634 INFO L87 Difference]: Start difference. First operand 255 states and 380 transitions. Second operand 4 states. [2019-12-07 13:27:38,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:38,877 INFO L93 Difference]: Finished difference Result 535 states and 800 transitions. [2019-12-07 13:27:38,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:38,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 13:27:38,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:38,878 INFO L225 Difference]: With dead ends: 535 [2019-12-07 13:27:38,878 INFO L226 Difference]: Without dead ends: 299 [2019-12-07 13:27:38,879 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 13:27:38,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-07 13:27:38,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 255. [2019-12-07 13:27:38,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-12-07 13:27:38,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 379 transitions. [2019-12-07 13:27:38,883 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 379 transitions. Word has length 100 [2019-12-07 13:27:38,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:38,883 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 379 transitions. [2019-12-07 13:27:38,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:38,883 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 379 transitions. [2019-12-07 13:27:38,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 13:27:38,884 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:38,884 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] [2019-12-07 13:27:38,884 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:38,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:38,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1992592176, now seen corresponding path program 1 times [2019-12-07 13:27:38,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:38,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327790540] [2019-12-07 13:27:38,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:38,919 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 13:27:38,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327790540] [2019-12-07 13:27:38,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:38,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:38,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975665595] [2019-12-07 13:27:38,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:38,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:38,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:38,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:38,920 INFO L87 Difference]: Start difference. First operand 255 states and 379 transitions. Second operand 4 states. [2019-12-07 13:27:39,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:39,118 INFO L93 Difference]: Finished difference Result 502 states and 751 transitions. [2019-12-07 13:27:39,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:39,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 13:27:39,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:39,119 INFO L225 Difference]: With dead ends: 502 [2019-12-07 13:27:39,120 INFO L226 Difference]: Without dead ends: 266 [2019-12-07 13:27:39,120 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 13:27:39,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-12-07 13:27:39,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 255. [2019-12-07 13:27:39,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-12-07 13:27:39,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 378 transitions. [2019-12-07 13:27:39,125 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 378 transitions. Word has length 100 [2019-12-07 13:27:39,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:39,125 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 378 transitions. [2019-12-07 13:27:39,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:39,125 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 378 transitions. [2019-12-07 13:27:39,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 13:27:39,126 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:39,126 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] [2019-12-07 13:27:39,126 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:39,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:39,126 INFO L82 PathProgramCache]: Analyzing trace with hash -368689638, now seen corresponding path program 1 times [2019-12-07 13:27:39,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:39,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274609919] [2019-12-07 13:27:39,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:39,172 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 13:27:39,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274609919] [2019-12-07 13:27:39,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:39,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:39,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226696952] [2019-12-07 13:27:39,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:39,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:39,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:39,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:39,173 INFO L87 Difference]: Start difference. First operand 255 states and 378 transitions. Second operand 4 states. [2019-12-07 13:27:39,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:39,439 INFO L93 Difference]: Finished difference Result 535 states and 796 transitions. [2019-12-07 13:27:39,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:39,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-12-07 13:27:39,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:39,441 INFO L225 Difference]: With dead ends: 535 [2019-12-07 13:27:39,441 INFO L226 Difference]: Without dead ends: 299 [2019-12-07 13:27:39,441 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 13:27:39,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-07 13:27:39,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 255. [2019-12-07 13:27:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-12-07 13:27:39,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 377 transitions. [2019-12-07 13:27:39,446 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 377 transitions. Word has length 104 [2019-12-07 13:27:39,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:39,446 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 377 transitions. [2019-12-07 13:27:39,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 377 transitions. [2019-12-07 13:27:39,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 13:27:39,447 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:39,448 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] [2019-12-07 13:27:39,448 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:39,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:39,448 INFO L82 PathProgramCache]: Analyzing trace with hash -786086244, now seen corresponding path program 1 times [2019-12-07 13:27:39,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:39,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999258085] [2019-12-07 13:27:39,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:39,490 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 13:27:39,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999258085] [2019-12-07 13:27:39,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:39,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:27:39,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625035806] [2019-12-07 13:27:39,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:27:39,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:39,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:27:39,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:39,492 INFO L87 Difference]: Start difference. First operand 255 states and 377 transitions. Second operand 3 states. [2019-12-07 13:27:39,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:39,535 INFO L93 Difference]: Finished difference Result 725 states and 1086 transitions. [2019-12-07 13:27:39,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:27:39,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-12-07 13:27:39,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:39,538 INFO L225 Difference]: With dead ends: 725 [2019-12-07 13:27:39,538 INFO L226 Difference]: Without dead ends: 489 [2019-12-07 13:27:39,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:39,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-12-07 13:27:39,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2019-12-07 13:27:39,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-12-07 13:27:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 723 transitions. [2019-12-07 13:27:39,550 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 723 transitions. Word has length 104 [2019-12-07 13:27:39,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:39,550 INFO L462 AbstractCegarLoop]: Abstraction has 489 states and 723 transitions. [2019-12-07 13:27:39,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:27:39,550 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 723 transitions. [2019-12-07 13:27:39,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 13:27:39,551 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:39,551 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:39,551 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:39,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:39,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1514654609, now seen corresponding path program 1 times [2019-12-07 13:27:39,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:39,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580051732] [2019-12-07 13:27:39,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:39,594 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 13:27:39,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580051732] [2019-12-07 13:27:39,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:39,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:27:39,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760428884] [2019-12-07 13:27:39,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:27:39,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:39,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:27:39,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:39,595 INFO L87 Difference]: Start difference. First operand 489 states and 723 transitions. Second operand 3 states. [2019-12-07 13:27:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:39,636 INFO L93 Difference]: Finished difference Result 1193 states and 1778 transitions. [2019-12-07 13:27:39,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:27:39,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-12-07 13:27:39,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:39,639 INFO L225 Difference]: With dead ends: 1193 [2019-12-07 13:27:39,639 INFO L226 Difference]: Without dead ends: 723 [2019-12-07 13:27:39,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:39,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-12-07 13:27:39,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2019-12-07 13:27:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-12-07 13:27:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1070 transitions. [2019-12-07 13:27:39,650 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1070 transitions. Word has length 123 [2019-12-07 13:27:39,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:39,650 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 1070 transitions. [2019-12-07 13:27:39,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:27:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1070 transitions. [2019-12-07 13:27:39,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 13:27:39,651 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:39,652 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] [2019-12-07 13:27:39,652 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:39,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:39,652 INFO L82 PathProgramCache]: Analyzing trace with hash -933599837, now seen corresponding path program 1 times [2019-12-07 13:27:39,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:39,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194563574] [2019-12-07 13:27:39,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:39,699 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-07 13:27:39,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194563574] [2019-12-07 13:27:39,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:39,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:27:39,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244372160] [2019-12-07 13:27:39,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:27:39,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:39,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:27:39,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:39,700 INFO L87 Difference]: Start difference. First operand 723 states and 1070 transitions. Second operand 3 states. [2019-12-07 13:27:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:39,750 INFO L93 Difference]: Finished difference Result 1655 states and 2463 transitions. [2019-12-07 13:27:39,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:27:39,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-12-07 13:27:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:39,753 INFO L225 Difference]: With dead ends: 1655 [2019-12-07 13:27:39,753 INFO L226 Difference]: Without dead ends: 951 [2019-12-07 13:27:39,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:39,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-12-07 13:27:39,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 951. [2019-12-07 13:27:39,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-12-07 13:27:39,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1406 transitions. [2019-12-07 13:27:39,768 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1406 transitions. Word has length 166 [2019-12-07 13:27:39,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:39,768 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 1406 transitions. [2019-12-07 13:27:39,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:27:39,769 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1406 transitions. [2019-12-07 13:27:39,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-12-07 13:27:39,770 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:39,770 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:39,770 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:39,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:39,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1664913724, now seen corresponding path program 1 times [2019-12-07 13:27:39,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:39,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041918540] [2019-12-07 13:27:39,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-12-07 13:27:39,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041918540] [2019-12-07 13:27:39,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:39,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:27:39,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830599444] [2019-12-07 13:27:39,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:27:39,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:39,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:27:39,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:39,830 INFO L87 Difference]: Start difference. First operand 951 states and 1406 transitions. Second operand 3 states. [2019-12-07 13:27:39,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:39,878 INFO L93 Difference]: Finished difference Result 2117 states and 3144 transitions. [2019-12-07 13:27:39,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:27:39,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-12-07 13:27:39,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:39,884 INFO L225 Difference]: With dead ends: 2117 [2019-12-07 13:27:39,885 INFO L226 Difference]: Without dead ends: 1185 [2019-12-07 13:27:39,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:39,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-12-07 13:27:39,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2019-12-07 13:27:39,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-12-07 13:27:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1755 transitions. [2019-12-07 13:27:39,910 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1755 transitions. Word has length 205 [2019-12-07 13:27:39,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:39,910 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 1755 transitions. [2019-12-07 13:27:39,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:27:39,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1755 transitions. [2019-12-07 13:27:39,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-12-07 13:27:39,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:39,912 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-12-07 13:27:39,912 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:39,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:39,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1064030038, now seen corresponding path program 1 times [2019-12-07 13:27:39,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:39,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459680883] [2019-12-07 13:27:39,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:39,992 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2019-12-07 13:27:39,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459680883] [2019-12-07 13:27:39,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:39,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:27:39,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501109723] [2019-12-07 13:27:39,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:27:39,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:39,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:27:39,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:39,994 INFO L87 Difference]: Start difference. First operand 1185 states and 1755 transitions. Second operand 3 states. [2019-12-07 13:27:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:40,055 INFO L93 Difference]: Finished difference Result 2585 states and 3842 transitions. [2019-12-07 13:27:40,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:27:40,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2019-12-07 13:27:40,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:40,061 INFO L225 Difference]: With dead ends: 2585 [2019-12-07 13:27:40,061 INFO L226 Difference]: Without dead ends: 1419 [2019-12-07 13:27:40,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:40,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2019-12-07 13:27:40,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1419. [2019-12-07 13:27:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-12-07 13:27:40,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2105 transitions. [2019-12-07 13:27:40,083 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2105 transitions. Word has length 247 [2019-12-07 13:27:40,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:40,083 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 2105 transitions. [2019-12-07 13:27:40,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:27:40,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2105 transitions. [2019-12-07 13:27:40,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-12-07 13:27:40,085 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:40,086 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:40,086 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:40,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:40,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2059484962, now seen corresponding path program 1 times [2019-12-07 13:27:40,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:40,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219382603] [2019-12-07 13:27:40,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2019-12-07 13:27:40,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219382603] [2019-12-07 13:27:40,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:40,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:40,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650301843] [2019-12-07 13:27:40,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:40,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:40,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:40,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:40,199 INFO L87 Difference]: Start difference. First operand 1419 states and 2105 transitions. Second operand 4 states. [2019-12-07 13:27:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:40,505 INFO L93 Difference]: Finished difference Result 3435 states and 5124 transitions. [2019-12-07 13:27:40,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:40,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2019-12-07 13:27:40,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:40,512 INFO L225 Difference]: With dead ends: 3435 [2019-12-07 13:27:40,512 INFO L226 Difference]: Without dead ends: 2035 [2019-12-07 13:27:40,514 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 13:27:40,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2019-12-07 13:27:40,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 1665. [2019-12-07 13:27:40,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1665 states. [2019-12-07 13:27:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2555 transitions. [2019-12-07 13:27:40,540 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2555 transitions. Word has length 291 [2019-12-07 13:27:40,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:40,540 INFO L462 AbstractCegarLoop]: Abstraction has 1665 states and 2555 transitions. [2019-12-07 13:27:40,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2555 transitions. [2019-12-07 13:27:40,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-12-07 13:27:40,542 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:40,543 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:40,543 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:40,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:40,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1624979364, now seen corresponding path program 1 times [2019-12-07 13:27:40,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:40,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171045874] [2019-12-07 13:27:40,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-12-07 13:27:40,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171045874] [2019-12-07 13:27:40,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:40,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:27:40,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627838719] [2019-12-07 13:27:40,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:27:40,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:40,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:27:40,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:40,631 INFO L87 Difference]: Start difference. First operand 1665 states and 2555 transitions. Second operand 3 states. [2019-12-07 13:27:40,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:40,702 INFO L93 Difference]: Finished difference Result 3581 states and 5510 transitions. [2019-12-07 13:27:40,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:27:40,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 291 [2019-12-07 13:27:40,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:40,711 INFO L225 Difference]: With dead ends: 3581 [2019-12-07 13:27:40,711 INFO L226 Difference]: Without dead ends: 1935 [2019-12-07 13:27:40,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:40,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-07 13:27:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-07 13:27:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-07 13:27:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2967 transitions. [2019-12-07 13:27:40,746 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2967 transitions. Word has length 291 [2019-12-07 13:27:40,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:40,746 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2967 transitions. [2019-12-07 13:27:40,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:27:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2967 transitions. [2019-12-07 13:27:40,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-12-07 13:27:40,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:40,749 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:40,749 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:40,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:40,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1789083782, now seen corresponding path program 1 times [2019-12-07 13:27:40,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:40,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237125473] [2019-12-07 13:27:40,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-12-07 13:27:40,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237125473] [2019-12-07 13:27:40,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:40,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:27:40,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70108947] [2019-12-07 13:27:40,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:27:40,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:40,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:27:40,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:40,878 INFO L87 Difference]: Start difference. First operand 1935 states and 2967 transitions. Second operand 3 states. [2019-12-07 13:27:40,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:40,929 INFO L93 Difference]: Finished difference Result 4126 states and 6341 transitions. [2019-12-07 13:27:40,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:27:40,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-12-07 13:27:40,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:40,937 INFO L225 Difference]: With dead ends: 4126 [2019-12-07 13:27:40,937 INFO L226 Difference]: Without dead ends: 2210 [2019-12-07 13:27:40,938 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:40,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2019-12-07 13:27:40,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 2210. [2019-12-07 13:27:40,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2210 states. [2019-12-07 13:27:40,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2210 states to 2210 states and 3394 transitions. [2019-12-07 13:27:40,968 INFO L78 Accepts]: Start accepts. Automaton has 2210 states and 3394 transitions. Word has length 331 [2019-12-07 13:27:40,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:40,968 INFO L462 AbstractCegarLoop]: Abstraction has 2210 states and 3394 transitions. [2019-12-07 13:27:40,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:27:40,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 3394 transitions. [2019-12-07 13:27:40,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-12-07 13:27:40,971 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:40,971 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 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] [2019-12-07 13:27:40,971 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:40,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:40,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1353737935, now seen corresponding path program 1 times [2019-12-07 13:27:40,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:40,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45812321] [2019-12-07 13:27:40,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 965 trivial. 0 not checked. [2019-12-07 13:27:41,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45812321] [2019-12-07 13:27:41,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:41,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:27:41,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636465923] [2019-12-07 13:27:41,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:27:41,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:41,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:27:41,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:41,094 INFO L87 Difference]: Start difference. First operand 2210 states and 3394 transitions. Second operand 3 states. [2019-12-07 13:27:41,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:41,150 INFO L93 Difference]: Finished difference Result 2487 states and 3824 transitions. [2019-12-07 13:27:41,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:27:41,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 374 [2019-12-07 13:27:41,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:41,159 INFO L225 Difference]: With dead ends: 2487 [2019-12-07 13:27:41,159 INFO L226 Difference]: Without dead ends: 2485 [2019-12-07 13:27:41,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2019-12-07 13:27:41,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2485. [2019-12-07 13:27:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2485 states. [2019-12-07 13:27:41,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 3822 transitions. [2019-12-07 13:27:41,194 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 3822 transitions. Word has length 374 [2019-12-07 13:27:41,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:41,194 INFO L462 AbstractCegarLoop]: Abstraction has 2485 states and 3822 transitions. [2019-12-07 13:27:41,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:27:41,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 3822 transitions. [2019-12-07 13:27:41,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-12-07 13:27:41,198 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:41,198 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 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] [2019-12-07 13:27:41,198 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:41,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:41,198 INFO L82 PathProgramCache]: Analyzing trace with hash 573108616, now seen corresponding path program 1 times [2019-12-07 13:27:41,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:41,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709320610] [2019-12-07 13:27:41,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 922 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2019-12-07 13:27:41,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709320610] [2019-12-07 13:27:41,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:41,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:27:41,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539942700] [2019-12-07 13:27:41,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:27:41,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:41,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:27:41,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:27:41,465 INFO L87 Difference]: Start difference. First operand 2485 states and 3822 transitions. Second operand 5 states. [2019-12-07 13:27:41,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:41,979 INFO L93 Difference]: Finished difference Result 7356 states and 11346 transitions. [2019-12-07 13:27:41,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:27:41,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 419 [2019-12-07 13:27:41,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:41,996 INFO L225 Difference]: With dead ends: 7356 [2019-12-07 13:27:41,996 INFO L226 Difference]: Without dead ends: 4890 [2019-12-07 13:27:41,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 13:27:42,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4890 states. [2019-12-07 13:27:42,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4890 to 4699. [2019-12-07 13:27:42,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4699 states. [2019-12-07 13:27:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4699 states to 4699 states and 7295 transitions. [2019-12-07 13:27:42,067 INFO L78 Accepts]: Start accepts. Automaton has 4699 states and 7295 transitions. Word has length 419 [2019-12-07 13:27:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:42,067 INFO L462 AbstractCegarLoop]: Abstraction has 4699 states and 7295 transitions. [2019-12-07 13:27:42,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:27:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 4699 states and 7295 transitions. [2019-12-07 13:27:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-12-07 13:27:42,072 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:42,072 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:42,072 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:42,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:42,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1618435896, now seen corresponding path program 1 times [2019-12-07 13:27:42,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:42,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760057856] [2019-12-07 13:27:42,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:42,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 916 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-12-07 13:27:42,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760057856] [2019-12-07 13:27:42,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:42,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:27:42,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598073013] [2019-12-07 13:27:42,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:27:42,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:42,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:27:42,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:27:42,391 INFO L87 Difference]: Start difference. First operand 4699 states and 7295 transitions. Second operand 7 states. [2019-12-07 13:27:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:44,001 INFO L93 Difference]: Finished difference Result 16859 states and 25967 transitions. [2019-12-07 13:27:44,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:27:44,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 419 [2019-12-07 13:27:44,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:44,015 INFO L225 Difference]: With dead ends: 16859 [2019-12-07 13:27:44,015 INFO L226 Difference]: Without dead ends: 12179 [2019-12-07 13:27:44,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:27:44,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12179 states. [2019-12-07 13:27:44,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12179 to 6591. [2019-12-07 13:27:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6591 states. [2019-12-07 13:27:44,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6591 states to 6591 states and 10642 transitions. [2019-12-07 13:27:44,145 INFO L78 Accepts]: Start accepts. Automaton has 6591 states and 10642 transitions. Word has length 419 [2019-12-07 13:27:44,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:44,145 INFO L462 AbstractCegarLoop]: Abstraction has 6591 states and 10642 transitions. [2019-12-07 13:27:44,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:27:44,145 INFO L276 IsEmpty]: Start isEmpty. Operand 6591 states and 10642 transitions. [2019-12-07 13:27:44,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-12-07 13:27:44,152 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:44,152 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:44,152 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:44,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:44,152 INFO L82 PathProgramCache]: Analyzing trace with hash -177425532, now seen corresponding path program 1 times [2019-12-07 13:27:44,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:44,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720055076] [2019-12-07 13:27:44,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 1008 proven. 0 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2019-12-07 13:27:44,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720055076] [2019-12-07 13:27:44,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:44,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:44,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595402911] [2019-12-07 13:27:44,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:44,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:44,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:44,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:44,350 INFO L87 Difference]: Start difference. First operand 6591 states and 10642 transitions. Second operand 4 states. [2019-12-07 13:27:44,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:44,737 INFO L93 Difference]: Finished difference Result 14299 states and 22747 transitions. [2019-12-07 13:27:44,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:44,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 421 [2019-12-07 13:27:44,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:44,745 INFO L225 Difference]: With dead ends: 14299 [2019-12-07 13:27:44,745 INFO L226 Difference]: Without dead ends: 7727 [2019-12-07 13:27:44,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 13:27:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7727 states. [2019-12-07 13:27:44,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7727 to 6609. [2019-12-07 13:27:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6609 states. [2019-12-07 13:27:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6609 states to 6609 states and 10660 transitions. [2019-12-07 13:27:44,866 INFO L78 Accepts]: Start accepts. Automaton has 6609 states and 10660 transitions. Word has length 421 [2019-12-07 13:27:44,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:44,866 INFO L462 AbstractCegarLoop]: Abstraction has 6609 states and 10660 transitions. [2019-12-07 13:27:44,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:44,867 INFO L276 IsEmpty]: Start isEmpty. Operand 6609 states and 10660 transitions. [2019-12-07 13:27:44,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-12-07 13:27:44,875 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:44,876 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:44,876 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:44,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:44,876 INFO L82 PathProgramCache]: Analyzing trace with hash -572426730, now seen corresponding path program 1 times [2019-12-07 13:27:44,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:44,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297384903] [2019-12-07 13:27:44,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:45,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1578 backedges. 925 proven. 0 refuted. 0 times theorem prover too weak. 653 trivial. 0 not checked. [2019-12-07 13:27:45,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297384903] [2019-12-07 13:27:45,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:45,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:27:45,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169311791] [2019-12-07 13:27:45,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:27:45,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:45,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:27:45,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:27:45,207 INFO L87 Difference]: Start difference. First operand 6609 states and 10660 transitions. Second operand 7 states. [2019-12-07 13:27:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:46,502 INFO L93 Difference]: Finished difference Result 15579 states and 24311 transitions. [2019-12-07 13:27:46,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:27:46,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 421 [2019-12-07 13:27:46,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:46,509 INFO L225 Difference]: With dead ends: 15579 [2019-12-07 13:27:46,509 INFO L226 Difference]: Without dead ends: 8989 [2019-12-07 13:27:46,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:27:46,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8989 states. [2019-12-07 13:27:46,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8989 to 5149. [2019-12-07 13:27:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5149 states. [2019-12-07 13:27:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5149 states to 5149 states and 8033 transitions. [2019-12-07 13:27:46,618 INFO L78 Accepts]: Start accepts. Automaton has 5149 states and 8033 transitions. Word has length 421 [2019-12-07 13:27:46,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:46,618 INFO L462 AbstractCegarLoop]: Abstraction has 5149 states and 8033 transitions. [2019-12-07 13:27:46,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:27:46,618 INFO L276 IsEmpty]: Start isEmpty. Operand 5149 states and 8033 transitions. [2019-12-07 13:27:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-12-07 13:27:46,624 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:46,624 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:46,624 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:46,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:46,624 INFO L82 PathProgramCache]: Analyzing trace with hash 695394340, now seen corresponding path program 1 times [2019-12-07 13:27:46,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:46,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347629333] [2019-12-07 13:27:46,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:46,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1814 backedges. 1146 proven. 92 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-12-07 13:27:46,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347629333] [2019-12-07 13:27:46,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139611996] [2019-12-07 13:27:46,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:27:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:47,075 INFO L264 TraceCheckSpWp]: Trace formula consists of 1457 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 13:27:47,091 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:27:47,138 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 13:27:47,139 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:47,141 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:47,141 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:27:47,142 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 13:27:47,161 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 74 treesize of output 62 [2019-12-07 13:27:47,162 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 13:27:47,164 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:47,167 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 38 [2019-12-07 13:27:47,167 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 13:27:47,169 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:47,214 INFO L343 Elim1Store]: treesize reduction 59, result has 52.0 percent of original size [2019-12-07 13:27:47,215 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 73 [2019-12-07 13:27:47,215 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:47,245 INFO L614 ElimStorePlain]: treesize reduction 22, result has 69.9 percent of original size [2019-12-07 13:27:47,248 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:27:47,248 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:19 [2019-12-07 13:27:47,272 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 13:27:47,273 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 13:27:47,273 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:47,274 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:47,275 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 13:27:47,275 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 13:27:47,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1814 backedges. 1135 proven. 28 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-12-07 13:27:47,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:27:47,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-12-07 13:27:47,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044194699] [2019-12-07 13:27:47,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 13:27:47,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:47,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 13:27:47,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:27:47,417 INFO L87 Difference]: Start difference. First operand 5149 states and 8033 transitions. Second operand 11 states. [2019-12-07 13:27:49,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:49,179 INFO L93 Difference]: Finished difference Result 15397 states and 23938 transitions. [2019-12-07 13:27:49,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 13:27:49,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 445 [2019-12-07 13:27:49,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:49,204 INFO L225 Difference]: With dead ends: 15397 [2019-12-07 13:27:49,204 INFO L226 Difference]: Without dead ends: 10267 [2019-12-07 13:27:49,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 443 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-07 13:27:49,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10267 states. [2019-12-07 13:27:49,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10267 to 6769. [2019-12-07 13:27:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6769 states. [2019-12-07 13:27:49,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6769 states to 6769 states and 11003 transitions. [2019-12-07 13:27:49,418 INFO L78 Accepts]: Start accepts. Automaton has 6769 states and 11003 transitions. Word has length 445 [2019-12-07 13:27:49,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:49,418 INFO L462 AbstractCegarLoop]: Abstraction has 6769 states and 11003 transitions. [2019-12-07 13:27:49,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 13:27:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 6769 states and 11003 transitions. [2019-12-07 13:27:49,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2019-12-07 13:27:49,428 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:49,428 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:49,629 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:27:49,629 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:49,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:49,629 INFO L82 PathProgramCache]: Analyzing trace with hash 60458544, now seen corresponding path program 1 times [2019-12-07 13:27:49,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:49,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139245103] [2019-12-07 13:27:49,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:49,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1728 backedges. 980 proven. 0 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked. [2019-12-07 13:27:49,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139245103] [2019-12-07 13:27:49,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:49,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:27:49,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226369485] [2019-12-07 13:27:49,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:27:49,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:49,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:27:49,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:27:49,880 INFO L87 Difference]: Start difference. First operand 6769 states and 11003 transitions. Second operand 7 states. [2019-12-07 13:27:51,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:51,589 INFO L93 Difference]: Finished difference Result 19094 states and 30009 transitions. [2019-12-07 13:27:51,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:27:51,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 449 [2019-12-07 13:27:51,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:51,598 INFO L225 Difference]: With dead ends: 19094 [2019-12-07 13:27:51,598 INFO L226 Difference]: Without dead ends: 12344 [2019-12-07 13:27:51,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:27:51,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12344 states. [2019-12-07 13:27:51,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12344 to 7759. [2019-12-07 13:27:51,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7759 states. [2019-12-07 13:27:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7759 states to 7759 states and 12740 transitions. [2019-12-07 13:27:51,760 INFO L78 Accepts]: Start accepts. Automaton has 7759 states and 12740 transitions. Word has length 449 [2019-12-07 13:27:51,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:51,760 INFO L462 AbstractCegarLoop]: Abstraction has 7759 states and 12740 transitions. [2019-12-07 13:27:51,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:27:51,760 INFO L276 IsEmpty]: Start isEmpty. Operand 7759 states and 12740 transitions. [2019-12-07 13:27:51,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2019-12-07 13:27:51,768 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:51,769 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:51,769 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:51,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:51,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1618269714, now seen corresponding path program 1 times [2019-12-07 13:27:51,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:51,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618431606] [2019-12-07 13:27:51,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1735 backedges. 942 proven. 0 refuted. 0 times theorem prover too weak. 793 trivial. 0 not checked. [2019-12-07 13:27:51,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618431606] [2019-12-07 13:27:51,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:51,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:51,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416542115] [2019-12-07 13:27:51,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:51,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:51,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:51,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:51,921 INFO L87 Difference]: Start difference. First operand 7759 states and 12740 transitions. Second operand 4 states. [2019-12-07 13:27:52,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:52,364 INFO L93 Difference]: Finished difference Result 16327 states and 26536 transitions. [2019-12-07 13:27:52,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:52,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 451 [2019-12-07 13:27:52,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:52,371 INFO L225 Difference]: With dead ends: 16327 [2019-12-07 13:27:52,371 INFO L226 Difference]: Without dead ends: 8587 [2019-12-07 13:27:52,377 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 13:27:52,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8587 states. [2019-12-07 13:27:52,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8587 to 7759. [2019-12-07 13:27:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7759 states. [2019-12-07 13:27:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7759 states to 7759 states and 12722 transitions. [2019-12-07 13:27:52,513 INFO L78 Accepts]: Start accepts. Automaton has 7759 states and 12722 transitions. Word has length 451 [2019-12-07 13:27:52,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:52,513 INFO L462 AbstractCegarLoop]: Abstraction has 7759 states and 12722 transitions. [2019-12-07 13:27:52,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 7759 states and 12722 transitions. [2019-12-07 13:27:52,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2019-12-07 13:27:52,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:52,521 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:52,521 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:52,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:52,521 INFO L82 PathProgramCache]: Analyzing trace with hash 2020833512, now seen corresponding path program 1 times [2019-12-07 13:27:52,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:52,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491714765] [2019-12-07 13:27:52,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 967 proven. 0 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2019-12-07 13:27:52,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491714765] [2019-12-07 13:27:52,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:52,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:27:52,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87517919] [2019-12-07 13:27:52,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:27:52,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:52,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:27:52,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:27:52,774 INFO L87 Difference]: Start difference. First operand 7759 states and 12722 transitions. Second operand 5 states. [2019-12-07 13:27:53,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:53,267 INFO L93 Difference]: Finished difference Result 16738 states and 27115 transitions. [2019-12-07 13:27:53,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:53,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 451 [2019-12-07 13:27:53,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:53,274 INFO L225 Difference]: With dead ends: 16738 [2019-12-07 13:27:53,274 INFO L226 Difference]: Without dead ends: 8998 [2019-12-07 13:27:53,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:27:53,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8998 states. [2019-12-07 13:27:53,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8998 to 7759. [2019-12-07 13:27:53,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7759 states. [2019-12-07 13:27:53,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7759 states to 7759 states and 12677 transitions. [2019-12-07 13:27:53,420 INFO L78 Accepts]: Start accepts. Automaton has 7759 states and 12677 transitions. Word has length 451 [2019-12-07 13:27:53,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:53,421 INFO L462 AbstractCegarLoop]: Abstraction has 7759 states and 12677 transitions. [2019-12-07 13:27:53,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:27:53,421 INFO L276 IsEmpty]: Start isEmpty. Operand 7759 states and 12677 transitions. [2019-12-07 13:27:53,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-12-07 13:27:53,426 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:53,426 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:53,426 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:53,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:53,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1383199474, now seen corresponding path program 1 times [2019-12-07 13:27:53,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:53,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345577419] [2019-12-07 13:27:53,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:53,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 838 proven. 156 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2019-12-07 13:27:53,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345577419] [2019-12-07 13:27:53,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282179640] [2019-12-07 13:27:53,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:27:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:53,855 INFO L264 TraceCheckSpWp]: Trace formula consists of 1475 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 13:27:53,863 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:27:53,885 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 13:27:53,885 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:53,887 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:53,887 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:27:53,887 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 13:27:53,898 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.offset_159|], 5=[|v_#memory_int_179|]} [2019-12-07 13:27:53,900 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 13:27:53,900 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 13:27:53,902 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:53,904 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 13:27:53,905 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 13:27:53,908 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:53,932 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:53,932 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 13:27:53,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:27:53,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:27:53,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:27:53,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:27:53,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:27:53,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:27:53,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:27:53,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:27:53,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:27:53,944 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@293bec84 [2019-12-07 13:27:53,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 13:27:53,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-12-07 13:27:53,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922594789] [2019-12-07 13:27:53,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:27:53,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:53,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:27:53,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:27:53,946 INFO L87 Difference]: Start difference. First operand 7759 states and 12677 transitions. Second operand 7 states. [2019-12-07 13:27:53,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 13:27:54,146 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:27:54,147 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@293bec84 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 13:27:54,152 INFO L168 Benchmark]: Toolchain (without parser) took 26699.53 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 875.6 MB). Free memory was 935.5 MB in the beginning and 931.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 879.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:27:54,152 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:27:54,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 410.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:27:54,153 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:27:54,154 INFO L168 Benchmark]: Boogie Preprocessor took 53.53 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:27:54,154 INFO L168 Benchmark]: RCFGBuilder took 681.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 972.9 MB in the end (delta: 99.3 MB). Peak memory consumption was 99.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:27:54,155 INFO L168 Benchmark]: TraceAbstraction took 25496.56 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 765.5 MB). Free memory was 972.9 MB in the beginning and 931.5 MB in the end (delta: 41.3 MB). Peak memory consumption was 806.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:27:54,157 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 410.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.53 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 681.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 972.9 MB in the end (delta: 99.3 MB). Peak memory consumption was 99.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25496.56 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 765.5 MB). Free memory was 972.9 MB in the beginning and 931.5 MB in the end (delta: 41.3 MB). Peak memory consumption was 806.8 MB. 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@293bec84 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@293bec84: 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 13:27:55,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:27:55,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:27:55,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:27:55,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:27:55,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:27:55,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:27:55,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:27:55,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:27:55,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:27:55,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:27:55,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:27:55,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:27:55,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:27:55,528 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:27:55,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:27:55,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:27:55,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:27:55,531 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:27:55,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:27:55,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:27:55,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:27:55,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:27:55,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:27:55,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:27:55,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:27:55,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:27:55,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:27:55,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:27:55,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:27:55,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:27:55,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:27:55,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:27:55,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:27:55,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:27:55,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:27:55,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:27:55,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:27:55,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:27:55,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:27:55,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:27:55,544 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 13:27:55,554 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:27:55,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:27:55,555 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:27:55,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:27:55,556 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:27:55,556 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:27:55,556 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:27:55,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:27:55,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:27:55,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:27:55,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:27:55,557 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:27:55,557 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 13:27:55,557 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 13:27:55,557 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:27:55,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:27:55,557 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:27:55,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:27:55,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:27:55,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:27:55,558 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:27:55,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:27:55,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:27:55,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:27:55,558 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:27:55,558 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:27:55,558 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 13:27:55,559 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 13:27:55,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:27:55,559 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:27:55,559 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:27:55,559 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_e8af2b24-d2e5-4a98-afbf-155202867053/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 -> a1dfcb1c5c2cc6f52bdafead8c203cf19b170f34 [2019-12-07 13:27:55,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:27:55,747 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:27:55,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:27:55,751 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:27:55,751 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:27:55,752 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-1.c [2019-12-07 13:27:55,792 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/data/cf059e33f/f3b9ce033e57469bba6f0621e0872a54/FLAG639f4fc56 [2019-12-07 13:27:56,333 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:27:56,334 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-1.c [2019-12-07 13:27:56,350 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/data/cf059e33f/f3b9ce033e57469bba6f0621e0872a54/FLAG639f4fc56 [2019-12-07 13:27:56,819 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/data/cf059e33f/f3b9ce033e57469bba6f0621e0872a54 [2019-12-07 13:27:56,821 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:27:56,822 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:27:56,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:27:56,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:27:56,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:27:56,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:27:56" (1/1) ... [2019-12-07 13:27:56,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@258d581a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:56, skipping insertion in model container [2019-12-07 13:27:56,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:27:56" (1/1) ... [2019-12-07 13:27:56,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:27:56,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:27:57,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:27:57,159 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:27:57,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:27:57,236 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:27:57,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:57 WrapperNode [2019-12-07 13:27:57,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:27:57,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:27:57,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:27:57,237 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:27:57,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:57" (1/1) ... [2019-12-07 13:27:57,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:57" (1/1) ... [2019-12-07 13:27:57,292 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:27:57,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:27:57,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:27:57,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:27:57,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:57" (1/1) ... [2019-12-07 13:27:57,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:57" (1/1) ... [2019-12-07 13:27:57,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:57" (1/1) ... [2019-12-07 13:27:57,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:57" (1/1) ... [2019-12-07 13:27:57,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:57" (1/1) ... [2019-12-07 13:27:57,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:57" (1/1) ... [2019-12-07 13:27:57,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:57" (1/1) ... [2019-12-07 13:27:57,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:27:57,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:27:57,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:27:57,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:27:57,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:27:57,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 13:27:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:27:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 13:27:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 13:27:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 13:27:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:27:57,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:27:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 13:27:57,525 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 13:27:59,369 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 13:27:59,369 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 13:27:59,370 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:27:59,370 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 13:27:59,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:27:59 BoogieIcfgContainer [2019-12-07 13:27:59,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:27:59,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:27:59,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:27:59,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:27:59,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:27:56" (1/3) ... [2019-12-07 13:27:59,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2760ddc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:27:59, skipping insertion in model container [2019-12-07 13:27:59,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:57" (2/3) ... [2019-12-07 13:27:59,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2760ddc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:27:59, skipping insertion in model container [2019-12-07 13:27:59,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:27:59" (3/3) ... [2019-12-07 13:27:59,376 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.08.i.cil-1.c [2019-12-07 13:27:59,383 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:27:59,387 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 13:27:59,395 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 13:27:59,412 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:27:59,412 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:27:59,413 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:27:59,413 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:27:59,413 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:27:59,413 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:27:59,413 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:27:59,413 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:27:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-12-07 13:27:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 13:27:59,432 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:59,433 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] [2019-12-07 13:27:59,433 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:59,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:59,437 INFO L82 PathProgramCache]: Analyzing trace with hash 62050801, now seen corresponding path program 1 times [2019-12-07 13:27:59,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:27:59,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513971478] [2019-12-07 13:27:59,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/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 13:27:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:59,586 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:27:59,594 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:27:59,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:27:59,635 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:27:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:27:59,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513971478] [2019-12-07 13:27:59,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:59,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 13:27:59,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804487494] [2019-12-07 13:27:59,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:59,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:27:59,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:59,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:59,681 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 4 states. [2019-12-07 13:27:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:59,812 INFO L93 Difference]: Finished difference Result 564 states and 965 transitions. [2019-12-07 13:27:59,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:59,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-12-07 13:27:59,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:59,828 INFO L225 Difference]: With dead ends: 564 [2019-12-07 13:27:59,828 INFO L226 Difference]: Without dead ends: 384 [2019-12-07 13:27:59,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:59,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-12-07 13:27:59,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2019-12-07 13:27:59,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-12-07 13:27:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 586 transitions. [2019-12-07 13:27:59,888 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 586 transitions. Word has length 43 [2019-12-07 13:27:59,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:59,888 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 586 transitions. [2019-12-07 13:27:59,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 586 transitions. [2019-12-07 13:27:59,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 13:27:59,894 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:59,895 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] [2019-12-07 13:28:00,095 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 13:28:00,096 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:28:00,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:00,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1805197181, now seen corresponding path program 1 times [2019-12-07 13:28:00,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:28:00,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55691423] [2019-12-07 13:28:00,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/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 13:28:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:00,318 INFO L264 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:28:00,322 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:00,349 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 13:28:00,349 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:28:00,368 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 13:28:00,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55691423] [2019-12-07 13:28:00,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:28:00,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 13:28:00,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009888045] [2019-12-07 13:28:00,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:28:00,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:28:00,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:28:00,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:28:00,371 INFO L87 Difference]: Start difference. First operand 384 states and 586 transitions. Second operand 4 states. [2019-12-07 13:28:01,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:01,302 INFO L93 Difference]: Finished difference Result 881 states and 1360 transitions. [2019-12-07 13:28:01,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:28:01,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-12-07 13:28:01,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:01,308 INFO L225 Difference]: With dead ends: 881 [2019-12-07 13:28:01,308 INFO L226 Difference]: Without dead ends: 630 [2019-12-07 13:28:01,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:28:01,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-12-07 13:28:01,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-12-07 13:28:01,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-12-07 13:28:01,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 958 transitions. [2019-12-07 13:28:01,346 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 958 transitions. Word has length 105 [2019-12-07 13:28:01,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:01,347 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 958 transitions. [2019-12-07 13:28:01,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:28:01,347 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 958 transitions. [2019-12-07 13:28:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-07 13:28:01,351 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:01,351 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] [2019-12-07 13:28:01,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 13:28:01,552 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:28:01,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:01,553 INFO L82 PathProgramCache]: Analyzing trace with hash -928550483, now seen corresponding path program 1 times [2019-12-07 13:28:01,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:28:01,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14551953] [2019-12-07 13:28:01,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/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 13:28:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:01,759 INFO L264 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:28:01,767 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:01,802 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 13:28:01,802 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:28:01,827 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 13:28:01,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14551953] [2019-12-07 13:28:01,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:28:01,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 13:28:01,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520648575] [2019-12-07 13:28:01,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:28:01,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:28:01,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:28:01,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:28:01,828 INFO L87 Difference]: Start difference. First operand 630 states and 958 transitions. Second operand 3 states. [2019-12-07 13:28:02,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:02,039 INFO L93 Difference]: Finished difference Result 1249 states and 1909 transitions. [2019-12-07 13:28:02,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:28:02,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-12-07 13:28:02,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:02,043 INFO L225 Difference]: With dead ends: 1249 [2019-12-07 13:28:02,044 INFO L226 Difference]: Without dead ends: 752 [2019-12-07 13:28:02,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:28:02,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-12-07 13:28:02,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2019-12-07 13:28:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-12-07 13:28:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1140 transitions. [2019-12-07 13:28:02,068 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1140 transitions. Word has length 170 [2019-12-07 13:28:02,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:02,068 INFO L462 AbstractCegarLoop]: Abstraction has 752 states and 1140 transitions. [2019-12-07 13:28:02,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:28:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1140 transitions. [2019-12-07 13:28:02,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-12-07 13:28:02,072 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:02,072 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 13:28:02,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 13:28:02,273 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:28:02,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:02,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1909543535, now seen corresponding path program 1 times [2019-12-07 13:28:02,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:28:02,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889206090] [2019-12-07 13:28:02,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/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 13:28:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:02,486 INFO L264 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:28:02,490 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 13:28:02,529 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:28:02,571 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 13:28:02,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889206090] [2019-12-07 13:28:02,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:28:02,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 13:28:02,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246060262] [2019-12-07 13:28:02,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:28:02,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:28:02,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:28:02,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:28:02,573 INFO L87 Difference]: Start difference. First operand 752 states and 1140 transitions. Second operand 4 states. [2019-12-07 13:28:03,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:03,114 INFO L93 Difference]: Finished difference Result 1616 states and 2465 transitions. [2019-12-07 13:28:03,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:28:03,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-12-07 13:28:03,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:03,121 INFO L225 Difference]: With dead ends: 1616 [2019-12-07 13:28:03,121 INFO L226 Difference]: Without dead ends: 997 [2019-12-07 13:28:03,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:28:03,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-12-07 13:28:03,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-12-07 13:28:03,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-12-07 13:28:03,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1510 transitions. [2019-12-07 13:28:03,163 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1510 transitions. Word has length 211 [2019-12-07 13:28:03,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:03,164 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1510 transitions. [2019-12-07 13:28:03,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:28:03,164 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1510 transitions. [2019-12-07 13:28:03,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-12-07 13:28:03,170 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:03,170 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:28:03,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 13:28:03,371 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:28:03,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:03,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1032540037, now seen corresponding path program 1 times [2019-12-07 13:28:03,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:28:03,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949324496] [2019-12-07 13:28:03,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/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 13:28:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:03,641 INFO L264 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:28:03,646 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-12-07 13:28:03,701 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:28:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-12-07 13:28:03,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949324496] [2019-12-07 13:28:03,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:28:03,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 13:28:03,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079977512] [2019-12-07 13:28:03,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:28:03,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:28:03,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:28:03,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:28:03,752 INFO L87 Difference]: Start difference. First operand 997 states and 1510 transitions. Second operand 3 states. [2019-12-07 13:28:04,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:04,202 INFO L93 Difference]: Finished difference Result 1982 states and 3011 transitions. [2019-12-07 13:28:04,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:28:04,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-12-07 13:28:04,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:04,208 INFO L225 Difference]: With dead ends: 1982 [2019-12-07 13:28:04,209 INFO L226 Difference]: Without dead ends: 1118 [2019-12-07 13:28:04,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:28:04,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2019-12-07 13:28:04,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1118. [2019-12-07 13:28:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2019-12-07 13:28:04,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1690 transitions. [2019-12-07 13:28:04,244 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1690 transitions. Word has length 294 [2019-12-07 13:28:04,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:04,245 INFO L462 AbstractCegarLoop]: Abstraction has 1118 states and 1690 transitions. [2019-12-07 13:28:04,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:28:04,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1690 transitions. [2019-12-07 13:28:04,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-12-07 13:28:04,249 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:04,249 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2019-12-07 13:28:04,449 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 13:28:04,450 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:28:04,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:04,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1811855194, now seen corresponding path program 1 times [2019-12-07 13:28:04,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:28:04,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799696452] [2019-12-07 13:28:04,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/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 13:28:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:04,708 INFO L264 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:28:04,711 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:04,808 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-12-07 13:28:04,809 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:28:04,873 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-12-07 13:28:04,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799696452] [2019-12-07 13:28:04,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:28:04,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 13:28:04,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449625761] [2019-12-07 13:28:04,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:28:04,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:28:04,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:28:04,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:28:04,875 INFO L87 Difference]: Start difference. First operand 1118 states and 1690 transitions. Second operand 4 states. [2019-12-07 13:28:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:05,484 INFO L93 Difference]: Finished difference Result 2348 states and 3564 transitions. [2019-12-07 13:28:05,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:28:05,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2019-12-07 13:28:05,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:05,489 INFO L225 Difference]: With dead ends: 2348 [2019-12-07 13:28:05,489 INFO L226 Difference]: Without dead ends: 1363 [2019-12-07 13:28:05,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:28:05,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-12-07 13:28:05,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1363. [2019-12-07 13:28:05,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-12-07 13:28:05,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2058 transitions. [2019-12-07 13:28:05,518 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2058 transitions. Word has length 333 [2019-12-07 13:28:05,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:05,519 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2058 transitions. [2019-12-07 13:28:05,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:28:05,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2058 transitions. [2019-12-07 13:28:05,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-12-07 13:28:05,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:05,522 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 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] [2019-12-07 13:28:05,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 13:28:05,723 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:28:05,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:05,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1696282884, now seen corresponding path program 1 times [2019-12-07 13:28:05,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:28:05,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277987929] [2019-12-07 13:28:05,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/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 13:28:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:06,206 INFO L264 TraceCheckSpWp]: Trace formula consists of 888 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:28:06,211 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:06,243 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 13:28:06,243 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:06,246 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:06,246 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:06,247 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:28:06,268 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 13:28:06,269 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 13:28:06,269 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:06,276 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:06,277 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:06,277 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 13:28:06,298 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 13:28:06,298 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 13:28:06,299 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:06,301 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:06,301 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 13:28:06,301 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2019-12-07 13:28:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 1003 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2019-12-07 13:28:06,438 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:28:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 1003 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2019-12-07 13:28:06,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277987929] [2019-12-07 13:28:06,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:28:06,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-12-07 13:28:06,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115856974] [2019-12-07 13:28:06,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:28:06,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:28:06,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:28:06,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:28:06,563 INFO L87 Difference]: Start difference. First operand 1363 states and 2058 transitions. Second operand 7 states. [2019-12-07 13:28:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:20,039 INFO L93 Difference]: Finished difference Result 5948 states and 9025 transitions. [2019-12-07 13:28:20,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:28:20,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 419 [2019-12-07 13:28:20,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:20,060 INFO L225 Difference]: With dead ends: 5948 [2019-12-07 13:28:20,060 INFO L226 Difference]: Without dead ends: 4593 [2019-12-07 13:28:20,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 839 GetRequests, 830 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:28:20,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2019-12-07 13:28:20,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 1832. [2019-12-07 13:28:20,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1832 states. [2019-12-07 13:28:20,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 2912 transitions. [2019-12-07 13:28:20,146 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 2912 transitions. Word has length 419 [2019-12-07 13:28:20,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:20,146 INFO L462 AbstractCegarLoop]: Abstraction has 1832 states and 2912 transitions. [2019-12-07 13:28:20,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:28:20,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2912 transitions. [2019-12-07 13:28:20,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-12-07 13:28:20,150 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:20,150 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 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] [2019-12-07 13:28:20,351 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 13:28:20,351 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:28:20,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:20,352 INFO L82 PathProgramCache]: Analyzing trace with hash 573108616, now seen corresponding path program 1 times [2019-12-07 13:28:20,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:28:20,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87007623] [2019-12-07 13:28:20,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/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 13:28:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:21,348 INFO L264 TraceCheckSpWp]: Trace formula consists of 888 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 13:28:21,355 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:21,711 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:21,712 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-12-07 13:28:21,713 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:22,192 WARN L192 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-12-07 13:28:22,192 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:22,195 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_214|], 2=[|v_#memory_$Pointer$.base_211|, |v_#memory_$Pointer$.base_210|]} [2019-12-07 13:28:22,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,316 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 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 13:28:22,316 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:22,459 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-12-07 13:28:22,459 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:22,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,484 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 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 13:28:22,485 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:22,559 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:22,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 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 13:28:22,571 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:22,596 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:22,597 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 13:28:22,597 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:109, output treesize:82 [2019-12-07 13:28:22,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,628 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:22,629 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 13:28:22,629 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:22,649 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:22,649 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:22,649 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:82 [2019-12-07 13:28:22,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,663 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:22,663 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 13:28:22,663 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:22,684 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:22,684 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:22,685 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:82 [2019-12-07 13:28:22,687 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_212|], 12=[|v_#memory_$Pointer$.base_217|]} [2019-12-07 13:28:22,693 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 13:28:22,779 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:22,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,789 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:22,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 61 [2019-12-07 13:28:22,789 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:22,816 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:22,816 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:22,816 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:82 [2019-12-07 13:28:22,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,827 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:22,827 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 13:28:22,828 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:22,848 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:22,848 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:22,848 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:82 [2019-12-07 13:28:22,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,856 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:22,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, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 13:28:22,857 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:22,877 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:22,878 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:22,878 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:82 [2019-12-07 13:28:22,884 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_210|], 20=[|v_#memory_$Pointer$.base_220|]} [2019-12-07 13:28:22,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,894 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 13:28:22,894 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:28:22,949 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:22,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:22,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:23,413 WARN L192 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-12-07 13:28:23,414 INFO L343 Elim1Store]: treesize reduction 34, result has 84.6 percent of original size [2019-12-07 13:28:23,414 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 116 treesize of output 226 [2019-12-07 13:28:23,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:23,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:23,662 INFO L534 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-12-07 13:28:24,024 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 70 [2019-12-07 13:28:24,025 INFO L614 ElimStorePlain]: treesize reduction 528, result has 35.8 percent of original size [2019-12-07 13:28:24,026 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-12-07 13:28:24,026 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:131, output treesize:352 [2019-12-07 13:28:24,186 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 41 [2019-12-07 13:28:24,191 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_213|], 30=[|v_#memory_$Pointer$.base_221|]} [2019-12-07 13:28:24,197 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 13:28:24,369 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-12-07 13:28:24,370 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:24,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:24,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:24,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:24,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:24,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:24,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:24,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:24,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:24,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:24,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:28:57,502 WARN L192 SmtUtils]: Spent 33.12 s on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2019-12-07 13:28:57,503 INFO L343 Elim1Store]: treesize reduction 22, result has 92.6 percent of original size [2019-12-07 13:28:57,503 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 130 treesize of output 346 [2019-12-07 13:28:57,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:57,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:57,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:57,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:57,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:57,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:57,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:28:57,509 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:02,538 WARN L192 SmtUtils]: Spent 2.08 m on a formula simplification. DAG size of input: 127 DAG size of output: 44 [2019-12-07 13:31:02,538 INFO L614 ElimStorePlain]: treesize reduction 15127, result has 0.8 percent of original size [2019-12-07 13:31:02,539 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:31:02,539 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:147, output treesize:109 [2019-12-07 13:31:02,565 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_232|], 30=[|v_#memory_$Pointer$.base_222|]} [2019-12-07 13:31:02,583 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 13:31:02,584 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:02,677 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:02,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:02,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:02,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:02,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:02,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:02,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:19,151 WARN L192 SmtUtils]: Spent 16.47 s on a formula simplification that was a NOOP. DAG size: 79 [2019-12-07 13:31:19,151 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:19,151 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 125 treesize of output 271 [2019-12-07 13:31:19,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:19,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:19,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,157 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:19,453 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 46 [2019-12-07 13:31:19,454 INFO L614 ElimStorePlain]: treesize reduction 4323, result has 2.7 percent of original size [2019-12-07 13:31:19,454 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:31:19,454 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:141, output treesize:118 [2019-12-07 13:31:19,529 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_211|], 2=[|v_#memory_int_233|], 20=[|v_#memory_$Pointer$.base_223|]} [2019-12-07 13:31:19,546 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 25 [2019-12-07 13:31:19,546 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 13:31:19,605 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:19,620 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 28 [2019-12-07 13:31:19,621 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:19,677 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:19,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:19,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:19,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:19,801 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 13:31:19,801 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:19,802 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 121 treesize of output 155 [2019-12-07 13:31:19,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:19,856 INFO L534 ElimStorePlain]: Start of recursive call 4: 122 dim-0 vars, End of recursive call: 122 dim-0 vars, and 15 xjuncts. [2019-12-07 13:31:35,505 WARN L192 SmtUtils]: Spent 15.65 s on a formula simplification that was a NOOP. DAG size: 1123 [2019-12-07 13:31:35,505 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:35,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:35,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 13:31:35,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:35,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:35,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-12-07 13:31:35,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 13:31:35,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:35,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:35,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 13 terms [2019-12-07 13:31:35,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-12-07 13:31:35,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:35,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 13:31:35,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:35,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:35,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:35,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 13:31:35,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:31:35,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:31:35,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:31:35,568 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 244 dim-0 vars, and 1 xjuncts. [2019-12-07 13:31:35,569 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:149, output treesize:1966 [2019-12-07 13:31:36,627 WARN L192 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 1357 DAG size of output: 25 [2019-12-07 13:31:36,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:31:36,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-12-07 13:31:36,633 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:36,647 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:36,647 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:31:36,648 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-12-07 13:31:36,699 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 13:31:36,699 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:36,704 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:36,704 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 13:31:36,705 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-12-07 13:31:37,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 856 proven. 82 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2019-12-07 13:31:37,345 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:31:37,389 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 37 treesize of output 31 [2019-12-07 13:31:37,389 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 13:31:37,393 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:37,393 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:31:37,393 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:31 [2019-12-07 13:31:37,443 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 13:31:37,448 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:37,449 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:31:37,458 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:37,458 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:31:37,458 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:15 [2019-12-07 13:31:37,484 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_241|], 2=[|v_#memory_$Pointer$.base_213|]} [2019-12-07 13:31:37,486 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 13:31:37,496 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:37,497 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 13:31:37,500 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:37,501 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 13:31:37,501 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:25 [2019-12-07 13:31:37,521 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 13:31:37,521 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 61 treesize of output 49 [2019-12-07 13:31:37,522 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:31:37,526 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:37,527 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 13:31:37,527 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:49 [2019-12-07 13:31:37,606 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 13:31:37,614 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:37,614 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 13:31:37,615 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-12-07 13:31:38,419 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 13:31:38,428 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:38,428 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 13:31:38,429 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-12-07 13:31:38,606 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_212|], 20=[|v_#memory_$Pointer$.base_245|]} [2019-12-07 13:31:38,611 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 13:31:38,642 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:38,644 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 13:31:38,655 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:38,656 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-07 13:31:38,656 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:90, output treesize:124 [2019-12-07 13:31:38,838 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 13:31:38,846 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:38,847 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 13:31:38,847 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-12-07 13:31:39,051 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 13:31:39,060 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:31:39,060 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 13:31:39,060 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-12-07 13:31:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 792 proven. 146 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2019-12-07 13:31:39,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87007623] [2019-12-07 13:31:39,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:31:39,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-12-07 13:31:39,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457018084] [2019-12-07 13:31:39,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:31:39,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:31:39,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:31:39,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:31:39,569 INFO L87 Difference]: Start difference. First operand 1832 states and 2912 transitions. Second operand 12 states. [2019-12-07 13:33:33,577 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-12-07 13:35:12,664 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-12-07 13:35:28,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:28,889 INFO L93 Difference]: Finished difference Result 6857 states and 10876 transitions. [2019-12-07 13:35:28,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:35:28,892 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 419 [2019-12-07 13:35:28,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:28,910 INFO L225 Difference]: With dead ends: 6857 [2019-12-07 13:35:28,910 INFO L226 Difference]: Without dead ends: 5033 [2019-12-07 13:35:28,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 819 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-07 13:35:28,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5033 states. [2019-12-07 13:35:28,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5033 to 2184. [2019-12-07 13:35:28,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2184 states. [2019-12-07 13:35:28,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 3550 transitions. [2019-12-07 13:35:28,990 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 3550 transitions. Word has length 419 [2019-12-07 13:35:28,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:28,990 INFO L462 AbstractCegarLoop]: Abstraction has 2184 states and 3550 transitions. [2019-12-07 13:35:28,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:35:28,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 3550 transitions. [2019-12-07 13:35:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-12-07 13:35:28,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:28,994 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 13:35:29,194 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 13:35:29,195 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:35:29,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:29,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1235047175, now seen corresponding path program 1 times [2019-12-07 13:35:29,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:35:29,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774133934] [2019-12-07 13:35:29,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/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 13:35:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:29,541 INFO L264 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:35:29,545 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:35:29,549 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_237|, |v_#memory_$Pointer$.base_249|], 4=[|v_#memory_int_260|]} [2019-12-07 13:35:29,550 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 85 [2019-12-07 13:35:29,550 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 13:35:29,558 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:29,559 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 85 treesize of output 49 [2019-12-07 13:35:29,560 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 13:35:29,566 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:29,595 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:29,595 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 2 case distinctions, treesize of input 49 treesize of output 55 [2019-12-07 13:35:29,595 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:37,738 WARN L192 SmtUtils]: Spent 8.14 s on a formula simplification that was a NOOP. DAG size: 22 [2019-12-07 13:35:37,739 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:37,739 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:35:37,739 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-12-07 13:35:37,747 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 13:35:37,747 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:37,748 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:37,748 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 13:35:37,749 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 13:35:37,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 902 proven. 0 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2019-12-07 13:35:37,848 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:35:37,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 902 proven. 0 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2019-12-07 13:35:37,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774133934] [2019-12-07 13:35:37,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:35:37,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 13:35:37,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282969607] [2019-12-07 13:35:37,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:35:37,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:35:37,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:35:37,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:35:37,944 INFO L87 Difference]: Start difference. First operand 2184 states and 3550 transitions. Second operand 4 states. [2019-12-07 13:35:40,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:40,013 INFO L93 Difference]: Finished difference Result 4679 states and 7562 transitions. [2019-12-07 13:35:40,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:35:40,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 461 [2019-12-07 13:35:40,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:40,023 INFO L225 Difference]: With dead ends: 4679 [2019-12-07 13:35:40,023 INFO L226 Difference]: Without dead ends: 2503 [2019-12-07 13:35:40,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 921 GetRequests, 918 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:35:40,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2019-12-07 13:35:40,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2360. [2019-12-07 13:35:40,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2360 states. [2019-12-07 13:35:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 3836 transitions. [2019-12-07 13:35:40,090 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 3836 transitions. Word has length 461 [2019-12-07 13:35:40,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:40,091 INFO L462 AbstractCegarLoop]: Abstraction has 2360 states and 3836 transitions. [2019-12-07 13:35:40,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:35:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 3836 transitions. [2019-12-07 13:35:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-12-07 13:35:40,094 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:40,094 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 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] [2019-12-07 13:35:40,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 13:35:40,296 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:35:40,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:40,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1513316754, now seen corresponding path program 1 times [2019-12-07 13:35:40,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:35:40,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605338662] [2019-12-07 13:35:40,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/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 13:35:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:40,642 INFO L264 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:35:40,646 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:35:40,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 13:35:40,652 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:40,654 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:40,655 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:35:40,655 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:35:40,663 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 13:35:40,663 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:40,665 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:40,665 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 13:35:40,665 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:35:40,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2027 backedges. 1159 proven. 0 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2019-12-07 13:35:40,778 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:35:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2027 backedges. 1159 proven. 0 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2019-12-07 13:35:40,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605338662] [2019-12-07 13:35:40,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:35:40,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:35:40,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081557530] [2019-12-07 13:35:40,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:35:40,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:35:40,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:35:40,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:35:40,925 INFO L87 Difference]: Start difference. First operand 2360 states and 3836 transitions. Second operand 6 states. [2019-12-07 13:35:46,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:46,484 INFO L93 Difference]: Finished difference Result 7852 states and 12676 transitions. [2019-12-07 13:35:46,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:35:46,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 461 [2019-12-07 13:35:46,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:46,504 INFO L225 Difference]: With dead ends: 7852 [2019-12-07 13:35:46,504 INFO L226 Difference]: Without dead ends: 5500 [2019-12-07 13:35:46,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 922 GetRequests, 916 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 13:35:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5500 states. [2019-12-07 13:35:46,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5500 to 3218. [2019-12-07 13:35:46,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3218 states. [2019-12-07 13:35:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3218 states to 3218 states and 5420 transitions. [2019-12-07 13:35:46,606 INFO L78 Accepts]: Start accepts. Automaton has 3218 states and 5420 transitions. Word has length 461 [2019-12-07 13:35:46,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:46,606 INFO L462 AbstractCegarLoop]: Abstraction has 3218 states and 5420 transitions. [2019-12-07 13:35:46,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:35:46,606 INFO L276 IsEmpty]: Start isEmpty. Operand 3218 states and 5420 transitions. [2019-12-07 13:35:46,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2019-12-07 13:35:46,610 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:46,611 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 3, 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] [2019-12-07 13:35:46,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 13:35:46,811 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:35:46,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:46,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1353060848, now seen corresponding path program 1 times [2019-12-07 13:35:46,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:35:46,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016348520] [2019-12-07 13:35:46,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/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 13:35:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:47,125 INFO L264 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:35:47,129 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:35:47,133 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 13:35:47,133 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:47,136 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:47,136 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:35:47,136 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:35:47,143 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 13:35:47,144 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:47,145 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:47,145 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 13:35:47,145 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 13:35:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 1171 proven. 0 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2019-12-07 13:35:47,257 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:35:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 1171 proven. 0 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2019-12-07 13:35:47,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016348520] [2019-12-07 13:35:47,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:35:47,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:35:47,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133774113] [2019-12-07 13:35:47,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:35:47,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:35:47,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:35:47,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:35:47,395 INFO L87 Difference]: Start difference. First operand 3218 states and 5420 transitions. Second operand 6 states. [2019-12-07 13:35:54,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:54,665 INFO L93 Difference]: Finished difference Result 8332 states and 13590 transitions. [2019-12-07 13:35:54,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:35:54,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 464 [2019-12-07 13:35:54,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:54,680 INFO L225 Difference]: With dead ends: 8332 [2019-12-07 13:35:54,680 INFO L226 Difference]: Without dead ends: 5122 [2019-12-07 13:35:54,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 928 GetRequests, 922 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 13:35:54,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5122 states. [2019-12-07 13:35:54,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5122 to 3229. [2019-12-07 13:35:54,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3229 states. [2019-12-07 13:35:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 5420 transitions. [2019-12-07 13:35:54,774 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 5420 transitions. Word has length 464 [2019-12-07 13:35:54,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:54,775 INFO L462 AbstractCegarLoop]: Abstraction has 3229 states and 5420 transitions. [2019-12-07 13:35:54,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:35:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 5420 transitions. [2019-12-07 13:35:54,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2019-12-07 13:35:54,779 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:54,779 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 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] [2019-12-07 13:35:54,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 13:35:54,980 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:35:54,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:54,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1950526340, now seen corresponding path program 1 times [2019-12-07 13:35:54,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:35:54,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645611742] [2019-12-07 13:35:54,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/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 13:35:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:56,088 INFO L264 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 13:35:56,095 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:35:56,537 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:56,537 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-12-07 13:35:56,538 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:57,113 WARN L192 SmtUtils]: Spent 575.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-12-07 13:35:57,114 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:57,116 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_313|, |v_#memory_int_322|], 2=[|v_#memory_$Pointer$.base_309|, |v_#memory_$Pointer$.base_310|]} [2019-12-07 13:35:57,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:57,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:57,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:57,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:57,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:57,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:57,311 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 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 13:35:57,311 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:57,588 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-12-07 13:35:57,588 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:57,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:57,615 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 13:35:57,615 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:57,805 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-12-07 13:35:57,805 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:57,809 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:57,906 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:57,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:57,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:57,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:57,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:57,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:57,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:57,921 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 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 13:35:57,921 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:57,964 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:57,964 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:35:57,964 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:127, output treesize:91 [2019-12-07 13:35:57,995 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_int_323|], 12=[|v_#memory_$Pointer$.base_314|]} [2019-12-07 13:35:58,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 13:35:58,008 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:58,076 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:58,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,084 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 13:35:58,084 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:58,109 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:58,109 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:35:58,110 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:131, output treesize:91 [2019-12-07 13:35:58,113 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_int_324|], 12=[|v_#memory_$Pointer$.base_315|]} [2019-12-07 13:35:58,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,130 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 13:35:58,130 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:58,190 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:58,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,197 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 13:35:58,198 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:58,228 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:58,229 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:35:58,229 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:123, output treesize:100 [2019-12-07 13:35:58,273 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_311|], 10=[|v_#memory_int_325|], 12=[|v_#memory_$Pointer$.base_316|]} [2019-12-07 13:35:58,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 13:35:58,493 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 13:35:58,493 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:58,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,531 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2019-12-07 13:35:58,532 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:58,653 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-12-07 13:35:58,653 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:58,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,666 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 61 [2019-12-07 13:35:58,666 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:58,702 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:58,703 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:35:58,703 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:156, output treesize:109 [2019-12-07 13:35:58,814 INFO L430 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.base_317|], 20=[|v_#memory_int_326|]} [2019-12-07 13:35:58,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,827 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 13:35:58,828 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:58,909 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:58,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:58,928 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2019-12-07 13:35:58,928 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:58,965 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:58,965 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:35:58,965 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:151, output treesize:119 [2019-12-07 13:35:59,023 INFO L430 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.base_318|], 20=[|v_#memory_int_327|]} [2019-12-07 13:35:59,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,040 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 13:35:59,041 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:59,124 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:59,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,141 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2019-12-07 13:35:59,142 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:59,180 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:59,180 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:35:59,180 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:151, output treesize:119 [2019-12-07 13:35:59,188 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_297|], 20=[|v_#memory_int_328|, |v_#memory_$Pointer$.base_319|]} [2019-12-07 13:35:59,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,197 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 75 [2019-12-07 13:35:59,197 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:35:59,290 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:59,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,311 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 50 [2019-12-07 13:35:59,311 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:59,388 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:59,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:35:59,892 WARN L192 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-12-07 13:35:59,893 INFO L343 Elim1Store]: treesize reduction 34, result has 84.6 percent of original size [2019-12-07 13:35:59,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 116 treesize of output 226 [2019-12-07 13:35:59,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:35:59,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:59,927 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:36:13,137 WARN L192 SmtUtils]: Spent 13.21 s on a formula simplification. DAG size of input: 115 DAG size of output: 61 [2019-12-07 13:36:13,138 INFO L614 ElimStorePlain]: treesize reduction 28042, result has 0.5 percent of original size [2019-12-07 13:36:13,138 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:36:13,138 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:217, output treesize:146 [2019-12-07 13:36:13,238 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_312|], 28=[|v_#memory_int_329|], 30=[|v_#memory_$Pointer$.base_320|]} [2019-12-07 13:36:13,251 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 13:36:13,606 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-07 13:36:13,606 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:36:13,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:36:13,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:36:13,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:36:13,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:36:13,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:36:13,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:36:13,686 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2019-12-07 13:36:13,687 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:36:13,853 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-07 13:36:13,854 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:36:13,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:36:13,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:36:13,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:36:13,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:36:13,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:36:13,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:36:13,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:36:13,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:36:13,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:36:13,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:36:46,995 WARN L192 SmtUtils]: Spent 33.13 s on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2019-12-07 13:36:46,995 INFO L343 Elim1Store]: treesize reduction 22, result has 92.6 percent of original size [2019-12-07 13:36:46,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 130 treesize of output 346 [2019-12-07 13:36:46,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:36:46,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:36:46,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:36:46,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:36:46,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:36:46,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:36:46,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:36:47,001 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:38:34,776 WARN L192 SmtUtils]: Spent 1.80 m on a formula simplification. DAG size of input: 147 DAG size of output: 62 [2019-12-07 13:38:34,776 INFO L614 ElimStorePlain]: treesize reduction 12251, result has 1.2 percent of original size [2019-12-07 13:38:34,776 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:38:34,777 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:202, output treesize:146 [2019-12-07 13:38:34,905 INFO L430 ElimStorePlain]: Different costs {20=[|v_#memory_int_330|], 30=[|v_#memory_$Pointer$.base_321|]} [2019-12-07 13:38:34,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:38:34,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:38:34,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:38:34,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:38:34,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:38:34,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:38:34,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2019-12-07 13:38:34,940 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:38:35,076 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-12-07 13:38:35,077 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:38:35,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:38:35,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:38:35,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:38:35,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:38:35,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:38:35,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:38:51,482 WARN L192 SmtUtils]: Spent 16.40 s on a formula simplification that was a NOOP. DAG size: 79 [2019-12-07 13:38:51,483 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:38:51,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 125 treesize of output 271 [2019-12-07 13:38:51,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:38:51,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:38:51,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:38:51,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:38:51,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:38:51,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:38:51,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:38:51,488 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:39:53,609 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-12-07 13:39:53,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645611742] [2019-12-07 13:39:53,610 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") [2019-12-07 13:39:53,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2032793895] [2019-12-07 13:39:53,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:39:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:39:56,750 INFO L264 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 13:39:56,750 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken [2019-12-07 13:39:56,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748675035] [2019-12-07 13:39:56,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e8af2b24-d2e5-4a98-afbf-155202867053/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:39:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:39:57,025 INFO L264 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 13:39:57,029 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:39:57,029 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by |v_ULTIMATE.start_ssl3_accept_#t~nondet17_7| [2019-12-07 13:39:57,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:39:57,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 13:39:57,030 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-12-07 13:39:57,030 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:39:57,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3,14 cvc4 --incremental --print-success --lang smt --rewrite-divk,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:39:57,712 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 13:39:57,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:39:57 BoogieIcfgContainer [2019-12-07 13:39:57,713 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:39:57,713 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:39:57,713 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:39:57,713 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:39:57,713 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:27:59" (3/4) ... [2019-12-07 13:39:57,715 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 13:39:57,715 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:39:57,716 INFO L168 Benchmark]: Toolchain (without parser) took 720894.71 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 262.1 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -211.6 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:39:57,716 INFO L168 Benchmark]: CDTParser took 0.19 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 13:39:57,717 INFO L168 Benchmark]: CACSL2BoogieTranslator took 414.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:39:57,717 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:39:57,717 INFO L168 Benchmark]: Boogie Preprocessor took 52.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:39:57,717 INFO L168 Benchmark]: RCFGBuilder took 2026.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 101.0 MB). Peak memory consumption was 101.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:39:57,718 INFO L168 Benchmark]: TraceAbstraction took 718340.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 121.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -156.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:39:57,718 INFO L168 Benchmark]: Witness Printer took 2.68 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:39:57,719 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 414.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2026.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 101.0 MB). Peak memory consumption was 101.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 718340.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 121.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -156.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.68 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1727]: 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->hit = __VERIFIER_nondet_int () [L1106] s->state = 8464 [L1107] blastFlag = 0 [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 [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] 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 TRUE s->hit [L1353] s->state = 8656 [L1357] s->init_num = 0 [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] 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 [L1563] EXPR s->session [L1563] EXPR s->s3 [L1563] EXPR (s->s3)->tmp.new_cipher [L1563] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1564] COND FALSE !(! tmp___9) [L1570] ret = __VERIFIER_nondet_int() [L1571] COND TRUE blastFlag == 2 [L1572] blastFlag = 3 [L1584] COND FALSE !(ret <= 0) [L1589] s->state = 8672 [L1590] s->init_num = 0 [L1591] COND FALSE !(! tmp___10) [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] 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 [L1600] ret = __VERIFIER_nondet_int() [L1601] COND TRUE blastFlag == 3 [L1602] blastFlag = 4 [L1614] COND FALSE !(ret <= 0) [L1619] s->state = 8448 [L1620] s->hit [L1620] COND TRUE s->hit [L1621] EXPR s->s3 [L1621] (s->s3)->tmp.next_state = 8640 [L1625] s->init_num = 0 [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] 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 TRUE s->state == 8448 [L1475] COND FALSE !(num1 > 0L) [L1488] EXPR s->s3 [L1488] EXPR (s->s3)->tmp.next_state [L1488] s->state = (s->s3)->tmp.next_state [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] 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 [L1535] ret = __VERIFIER_nondet_int() [L1536] COND TRUE blastFlag == 4 [L1537] blastFlag = 5 [L1549] COND FALSE !(ret <= 0) [L1554] s->hit [L1554] COND FALSE !(s->hit) [L1557] s->state = 8656 [L1559] s->init_num = 0 [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] 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 [L1563] EXPR s->session [L1563] EXPR s->s3 [L1563] EXPR (s->s3)->tmp.new_cipher [L1563] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1564] COND FALSE !(! tmp___9) [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 2) [L1574] COND TRUE blastFlag == 5 [L1575] blastFlag = 6 [L1584] COND FALSE !(ret <= 0) [L1589] s->state = 8672 [L1590] s->init_num = 0 [L1591] COND FALSE !(! tmp___10) [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] 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 [L1600] ret = __VERIFIER_nondet_int() [L1601] COND FALSE !(blastFlag == 3) [L1604] COND TRUE blastFlag == 6 [L1605] blastFlag = 7 [L1614] COND FALSE !(ret <= 0) [L1619] s->state = 8448 [L1620] s->hit [L1620] COND TRUE s->hit [L1621] EXPR s->s3 [L1621] (s->s3)->tmp.next_state = 8640 [L1625] s->init_num = 0 [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] 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 TRUE s->state == 8448 [L1475] COND FALSE !(num1 > 0L) [L1488] EXPR s->s3 [L1488] EXPR (s->s3)->tmp.next_state [L1488] s->state = (s->s3)->tmp.next_state [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] 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 [L1535] ret = __VERIFIER_nondet_int() [L1536] COND FALSE !(blastFlag == 4) [L1539] COND TRUE blastFlag == 7 [L1540] blastFlag = 8 [L1549] COND FALSE !(ret <= 0) [L1554] s->hit [L1554] COND FALSE !(s->hit) [L1557] s->state = 8656 [L1559] s->init_num = 0 [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] 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 [L1563] EXPR s->session [L1563] EXPR s->s3 [L1563] EXPR (s->s3)->tmp.new_cipher [L1563] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1564] COND FALSE !(! tmp___9) [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 2) [L1574] COND FALSE !(blastFlag == 5) [L1577] COND TRUE blastFlag == 8 [L1578] blastFlag = 9 [L1584] COND FALSE !(ret <= 0) [L1589] s->state = 8672 [L1590] s->init_num = 0 [L1591] COND FALSE !(! tmp___10) [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] 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 [L1600] ret = __VERIFIER_nondet_int() [L1601] COND FALSE !(blastFlag == 3) [L1604] COND FALSE !(blastFlag == 6) [L1607] COND TRUE blastFlag == 9 [L1608] blastFlag = 10 [L1614] COND FALSE !(ret <= 0) [L1619] s->state = 8448 [L1620] s->hit [L1620] COND TRUE s->hit [L1621] EXPR s->s3 [L1621] (s->s3)->tmp.next_state = 8640 [L1625] s->init_num = 0 [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] 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 TRUE s->state == 8448 [L1475] COND FALSE !(num1 > 0L) [L1488] EXPR s->s3 [L1488] EXPR (s->s3)->tmp.next_state [L1488] s->state = (s->s3)->tmp.next_state [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] 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 [L1535] ret = __VERIFIER_nondet_int() [L1536] COND FALSE !(blastFlag == 4) [L1539] COND FALSE !(blastFlag == 7) [L1542] COND TRUE blastFlag == 10 [L1727] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 149 locations, 1 error locations. Result: UNKNOWN, OverallTime: 718.2s, OverallIterations: 12, TraceHistogramMax: 14, AutomataDifference: 260.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3266 SDtfs, 2952 SDslu, 5179 SDs, 0 SdLazy, 4221 SolverSat, 517 SolverUnsat, 97 SolverUnknown, 0 SolverNotchecked, 255.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6751 GetRequests, 6695 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3229occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 9928 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 208.3s InterpolantComputationTime, 3380 NumberOfCodeBlocks, 3380 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 6738 ConstructedInterpolants, 197 QuantifiedInterpolants, 11078013 SizeOfPredicates, 32 NumberOfNonLiveVariables, 7315 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 22302/22530 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...