./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/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 8ae4fea535defe079744031ef9589bd179b2820b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/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 8ae4fea535defe079744031ef9589bd179b2820b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 10:45:34,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:45:34,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:45:34,923 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:45:34,924 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:45:34,925 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:45:34,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:45:34,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:45:34,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:45:34,943 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:45:34,944 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:45:34,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:45:34,945 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:45:34,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:45:34,949 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:45:34,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:45:34,951 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:45:34,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:45:34,954 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:45:34,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:45:34,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:45:34,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:45:34,964 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:45:34,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:45:34,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:45:34,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:45:34,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:45:34,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:45:34,970 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:45:34,971 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:45:34,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:45:34,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:45:34,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:45:34,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:45:34,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:45:34,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:45:34,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:45:34,974 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:45:34,974 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:45:34,975 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:45:34,976 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:45:34,977 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 10:45:35,001 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:45:35,001 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:45:35,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:45:35,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:45:35,002 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:45:35,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:45:35,003 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:45:35,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:45:35,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:45:35,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:45:35,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:45:35,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:45:35,004 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:45:35,004 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:45:35,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:45:35,004 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:45:35,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:45:35,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:45:35,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:45:35,005 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:45:35,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:45:35,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:45:35,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:45:35,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:45:35,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:45:35,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 10:45:35,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 10:45:35,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:45:35,007 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_020a20bd-894a-4328-b16b-2587c61f81a2/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 -> 8ae4fea535defe079744031ef9589bd179b2820b [2019-11-20 10:45:35,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:45:35,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:45:35,198 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:45:35,200 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:45:35,200 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:45:35,201 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-2.c [2019-11-20 10:45:35,259 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/data/ea4930df5/dcfae2b8938c4a5dbefa4e6f3a0aa02b/FLAGee36de4fd [2019-11-20 10:45:35,839 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:45:35,840 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-2.c [2019-11-20 10:45:35,861 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/data/ea4930df5/dcfae2b8938c4a5dbefa4e6f3a0aa02b/FLAGee36de4fd [2019-11-20 10:45:36,067 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/data/ea4930df5/dcfae2b8938c4a5dbefa4e6f3a0aa02b [2019-11-20 10:45:36,072 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:45:36,073 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:45:36,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:45:36,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:45:36,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:45:36,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:45:36" (1/1) ... [2019-11-20 10:45:36,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@416f8652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:36, skipping insertion in model container [2019-11-20 10:45:36,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:45:36" (1/1) ... [2019-11-20 10:45:36,093 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:45:36,172 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:45:36,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:45:36,667 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:45:36,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:45:36,868 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:45:36,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:36 WrapperNode [2019-11-20 10:45:36,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:45:36,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:45:36,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:45:36,870 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:45:36,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:36" (1/1) ... [2019-11-20 10:45:36,914 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:36" (1/1) ... [2019-11-20 10:45:36,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:45:36,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:45:36,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:45:36,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:45:36,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:36" (1/1) ... [2019-11-20 10:45:36,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:36" (1/1) ... [2019-11-20 10:45:36,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:36" (1/1) ... [2019-11-20 10:45:37,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:36" (1/1) ... [2019-11-20 10:45:37,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:36" (1/1) ... [2019-11-20 10:45:37,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:36" (1/1) ... [2019-11-20 10:45:37,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:36" (1/1) ... [2019-11-20 10:45:37,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:45:37,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:45:37,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:45:37,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:45:37,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:45:37,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 10:45:37,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 10:45:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 10:45:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 10:45:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 10:45:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 10:45:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:45:37,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:45:37,428 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 10:45:38,264 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 10:45:38,264 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 10:45:38,265 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:45:38,265 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 10:45:38,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:45:38 BoogieIcfgContainer [2019-11-20 10:45:38,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:45:38,267 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:45:38,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:45:38,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:45:38,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:45:36" (1/3) ... [2019-11-20 10:45:38,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a11e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:45:38, skipping insertion in model container [2019-11-20 10:45:38,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:45:36" (2/3) ... [2019-11-20 10:45:38,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a11e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:45:38, skipping insertion in model container [2019-11-20 10:45:38,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:45:38" (3/3) ... [2019-11-20 10:45:38,272 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14.i.cil-2.c [2019-11-20 10:45:38,281 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:45:38,287 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 10:45:38,296 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 10:45:38,320 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:45:38,320 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 10:45:38,321 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:45:38,321 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:45:38,321 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:45:38,321 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:45:38,321 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:45:38,321 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:45:38,346 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2019-11-20 10:45:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 10:45:38,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:38,355 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:38,355 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:38,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:38,359 INFO L82 PathProgramCache]: Analyzing trace with hash 557484008, now seen corresponding path program 1 times [2019-11-20 10:45:38,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:38,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105438567] [2019-11-20 10:45:38,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:45:38,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105438567] [2019-11-20 10:45:38,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:38,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:38,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164777411] [2019-11-20 10:45:38,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:38,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:38,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:38,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:38,687 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 4 states. [2019-11-20 10:45:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:39,196 INFO L93 Difference]: Finished difference Result 333 states and 567 transitions. [2019-11-20 10:45:39,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:39,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-20 10:45:39,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:39,217 INFO L225 Difference]: With dead ends: 333 [2019-11-20 10:45:39,217 INFO L226 Difference]: Without dead ends: 168 [2019-11-20 10:45:39,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:39,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-20 10:45:39,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2019-11-20 10:45:39,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-20 10:45:39,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 236 transitions. [2019-11-20 10:45:39,293 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 236 transitions. Word has length 42 [2019-11-20 10:45:39,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:39,294 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 236 transitions. [2019-11-20 10:45:39,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:39,294 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 236 transitions. [2019-11-20 10:45:39,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-20 10:45:39,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:39,297 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:39,297 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:39,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:39,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1860834976, now seen corresponding path program 1 times [2019-11-20 10:45:39,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:39,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471770752] [2019-11-20 10:45:39,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:45:39,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471770752] [2019-11-20 10:45:39,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:39,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:39,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525828245] [2019-11-20 10:45:39,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:39,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:39,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:39,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:39,424 INFO L87 Difference]: Start difference. First operand 151 states and 236 transitions. Second operand 4 states. [2019-11-20 10:45:39,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:39,831 INFO L93 Difference]: Finished difference Result 300 states and 463 transitions. [2019-11-20 10:45:39,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:39,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-20 10:45:39,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:39,834 INFO L225 Difference]: With dead ends: 300 [2019-11-20 10:45:39,834 INFO L226 Difference]: Without dead ends: 168 [2019-11-20 10:45:39,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:39,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-20 10:45:39,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2019-11-20 10:45:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-20 10:45:39,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 235 transitions. [2019-11-20 10:45:39,855 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 235 transitions. Word has length 55 [2019-11-20 10:45:39,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:39,856 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 235 transitions. [2019-11-20 10:45:39,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:39,856 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 235 transitions. [2019-11-20 10:45:39,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:45:39,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:39,866 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:39,866 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:39,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:39,867 INFO L82 PathProgramCache]: Analyzing trace with hash -2101358450, now seen corresponding path program 1 times [2019-11-20 10:45:39,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:39,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35512914] [2019-11-20 10:45:39,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:40,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:45:40,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35512914] [2019-11-20 10:45:40,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:40,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:40,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389508590] [2019-11-20 10:45:40,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:40,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:40,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:40,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:40,049 INFO L87 Difference]: Start difference. First operand 151 states and 235 transitions. Second operand 4 states. [2019-11-20 10:45:40,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:40,383 INFO L93 Difference]: Finished difference Result 299 states and 461 transitions. [2019-11-20 10:45:40,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:40,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-20 10:45:40,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:40,386 INFO L225 Difference]: With dead ends: 299 [2019-11-20 10:45:40,386 INFO L226 Difference]: Without dead ends: 167 [2019-11-20 10:45:40,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:40,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-20 10:45:40,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 151. [2019-11-20 10:45:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-20 10:45:40,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 234 transitions. [2019-11-20 10:45:40,402 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 234 transitions. Word has length 56 [2019-11-20 10:45:40,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:40,403 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 234 transitions. [2019-11-20 10:45:40,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:40,403 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 234 transitions. [2019-11-20 10:45:40,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:45:40,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:40,404 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:40,404 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:40,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:40,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1331085059, now seen corresponding path program 1 times [2019-11-20 10:45:40,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:40,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785637456] [2019-11-20 10:45:40,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:45:40,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785637456] [2019-11-20 10:45:40,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:40,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:40,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027140231] [2019-11-20 10:45:40,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:40,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:40,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:40,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:40,528 INFO L87 Difference]: Start difference. First operand 151 states and 234 transitions. Second operand 4 states. [2019-11-20 10:45:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:40,800 INFO L93 Difference]: Finished difference Result 297 states and 458 transitions. [2019-11-20 10:45:40,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:40,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-20 10:45:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:40,802 INFO L225 Difference]: With dead ends: 297 [2019-11-20 10:45:40,802 INFO L226 Difference]: Without dead ends: 165 [2019-11-20 10:45:40,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:40,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-20 10:45:40,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-11-20 10:45:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-20 10:45:40,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 233 transitions. [2019-11-20 10:45:40,812 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 233 transitions. Word has length 56 [2019-11-20 10:45:40,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:40,812 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 233 transitions. [2019-11-20 10:45:40,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 233 transitions. [2019-11-20 10:45:40,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:45:40,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:40,813 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:40,813 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:40,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:40,814 INFO L82 PathProgramCache]: Analyzing trace with hash 10231747, now seen corresponding path program 1 times [2019-11-20 10:45:40,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:40,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393815204] [2019-11-20 10:45:40,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:45:40,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393815204] [2019-11-20 10:45:40,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:40,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:40,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957900615] [2019-11-20 10:45:40,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:40,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:40,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:40,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:40,876 INFO L87 Difference]: Start difference. First operand 151 states and 233 transitions. Second operand 4 states. [2019-11-20 10:45:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:41,172 INFO L93 Difference]: Finished difference Result 296 states and 456 transitions. [2019-11-20 10:45:41,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:41,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-20 10:45:41,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:41,174 INFO L225 Difference]: With dead ends: 296 [2019-11-20 10:45:41,175 INFO L226 Difference]: Without dead ends: 164 [2019-11-20 10:45:41,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:41,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-20 10:45:41,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2019-11-20 10:45:41,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-20 10:45:41,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 232 transitions. [2019-11-20 10:45:41,187 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 232 transitions. Word has length 56 [2019-11-20 10:45:41,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:41,187 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 232 transitions. [2019-11-20 10:45:41,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:41,188 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 232 transitions. [2019-11-20 10:45:41,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:45:41,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:41,189 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:41,189 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:41,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:41,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1146098042, now seen corresponding path program 1 times [2019-11-20 10:45:41,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:41,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408125449] [2019-11-20 10:45:41,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:41,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:45:41,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408125449] [2019-11-20 10:45:41,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:41,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:41,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028431427] [2019-11-20 10:45:41,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:41,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:41,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:41,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:41,267 INFO L87 Difference]: Start difference. First operand 151 states and 232 transitions. Second operand 4 states. [2019-11-20 10:45:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:41,542 INFO L93 Difference]: Finished difference Result 296 states and 455 transitions. [2019-11-20 10:45:41,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:41,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-20 10:45:41,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:41,544 INFO L225 Difference]: With dead ends: 296 [2019-11-20 10:45:41,544 INFO L226 Difference]: Without dead ends: 164 [2019-11-20 10:45:41,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:41,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-20 10:45:41,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2019-11-20 10:45:41,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-20 10:45:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 231 transitions. [2019-11-20 10:45:41,552 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 231 transitions. Word has length 56 [2019-11-20 10:45:41,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:41,552 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 231 transitions. [2019-11-20 10:45:41,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 231 transitions. [2019-11-20 10:45:41,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 10:45:41,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:41,554 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:41,554 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:41,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:41,555 INFO L82 PathProgramCache]: Analyzing trace with hash -618208905, now seen corresponding path program 1 times [2019-11-20 10:45:41,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:41,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678420337] [2019-11-20 10:45:41,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:41,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:45:41,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678420337] [2019-11-20 10:45:41,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:41,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:41,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746828581] [2019-11-20 10:45:41,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:41,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:41,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:41,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:41,619 INFO L87 Difference]: Start difference. First operand 151 states and 231 transitions. Second operand 4 states. [2019-11-20 10:45:41,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:41,861 INFO L93 Difference]: Finished difference Result 296 states and 454 transitions. [2019-11-20 10:45:41,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:41,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-20 10:45:41,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:41,862 INFO L225 Difference]: With dead ends: 296 [2019-11-20 10:45:41,863 INFO L226 Difference]: Without dead ends: 164 [2019-11-20 10:45:41,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:41,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-20 10:45:41,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2019-11-20 10:45:41,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-20 10:45:41,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 230 transitions. [2019-11-20 10:45:41,868 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 230 transitions. Word has length 57 [2019-11-20 10:45:41,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:41,869 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 230 transitions. [2019-11-20 10:45:41,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:41,869 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 230 transitions. [2019-11-20 10:45:41,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 10:45:41,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:41,870 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:41,871 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:41,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:41,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1098918603, now seen corresponding path program 1 times [2019-11-20 10:45:41,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:41,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131448382] [2019-11-20 10:45:41,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:41,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:45:41,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131448382] [2019-11-20 10:45:41,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:41,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:41,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111503369] [2019-11-20 10:45:41,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:41,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:41,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:41,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:41,925 INFO L87 Difference]: Start difference. First operand 151 states and 230 transitions. Second operand 4 states. [2019-11-20 10:45:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:42,245 INFO L93 Difference]: Finished difference Result 296 states and 453 transitions. [2019-11-20 10:45:42,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:42,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-20 10:45:42,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:42,246 INFO L225 Difference]: With dead ends: 296 [2019-11-20 10:45:42,246 INFO L226 Difference]: Without dead ends: 164 [2019-11-20 10:45:42,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:42,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-20 10:45:42,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2019-11-20 10:45:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-20 10:45:42,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 229 transitions. [2019-11-20 10:45:42,252 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 229 transitions. Word has length 58 [2019-11-20 10:45:42,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:42,252 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 229 transitions. [2019-11-20 10:45:42,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:42,252 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 229 transitions. [2019-11-20 10:45:42,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 10:45:42,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:42,253 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:42,253 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:42,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:42,254 INFO L82 PathProgramCache]: Analyzing trace with hash -442819246, now seen corresponding path program 1 times [2019-11-20 10:45:42,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:42,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123992127] [2019-11-20 10:45:42,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:45:42,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123992127] [2019-11-20 10:45:42,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:42,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:42,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380076787] [2019-11-20 10:45:42,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:42,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:42,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:42,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:42,309 INFO L87 Difference]: Start difference. First operand 151 states and 229 transitions. Second operand 4 states. [2019-11-20 10:45:42,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:42,583 INFO L93 Difference]: Finished difference Result 286 states and 439 transitions. [2019-11-20 10:45:42,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:42,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 10:45:42,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:42,585 INFO L225 Difference]: With dead ends: 286 [2019-11-20 10:45:42,585 INFO L226 Difference]: Without dead ends: 154 [2019-11-20 10:45:42,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:42,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-20 10:45:42,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2019-11-20 10:45:42,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-20 10:45:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 228 transitions. [2019-11-20 10:45:42,591 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 228 transitions. Word has length 59 [2019-11-20 10:45:42,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:42,591 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 228 transitions. [2019-11-20 10:45:42,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:42,591 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 228 transitions. [2019-11-20 10:45:42,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 10:45:42,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:42,593 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:42,593 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:42,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:42,593 INFO L82 PathProgramCache]: Analyzing trace with hash 230179562, now seen corresponding path program 1 times [2019-11-20 10:45:42,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:42,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038305208] [2019-11-20 10:45:42,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:45:42,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038305208] [2019-11-20 10:45:42,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:42,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:42,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835973740] [2019-11-20 10:45:42,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:42,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:42,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:42,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:42,684 INFO L87 Difference]: Start difference. First operand 151 states and 228 transitions. Second operand 4 states. [2019-11-20 10:45:43,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:43,028 INFO L93 Difference]: Finished difference Result 326 states and 500 transitions. [2019-11-20 10:45:43,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:43,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 10:45:43,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:43,030 INFO L225 Difference]: With dead ends: 326 [2019-11-20 10:45:43,030 INFO L226 Difference]: Without dead ends: 194 [2019-11-20 10:45:43,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:43,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-20 10:45:43,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 173. [2019-11-20 10:45:43,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-20 10:45:43,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 266 transitions. [2019-11-20 10:45:43,036 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 266 transitions. Word has length 59 [2019-11-20 10:45:43,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:43,044 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 266 transitions. [2019-11-20 10:45:43,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 266 transitions. [2019-11-20 10:45:43,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-20 10:45:43,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:43,045 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:43,046 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:43,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:43,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1572577694, now seen corresponding path program 1 times [2019-11-20 10:45:43,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:43,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401979557] [2019-11-20 10:45:43,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:45:43,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401979557] [2019-11-20 10:45:43,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:43,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:43,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159479655] [2019-11-20 10:45:43,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:43,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:43,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:43,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:43,117 INFO L87 Difference]: Start difference. First operand 173 states and 266 transitions. Second operand 4 states. [2019-11-20 10:45:43,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:43,420 INFO L93 Difference]: Finished difference Result 348 states and 537 transitions. [2019-11-20 10:45:43,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:43,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-20 10:45:43,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:43,422 INFO L225 Difference]: With dead ends: 348 [2019-11-20 10:45:43,423 INFO L226 Difference]: Without dead ends: 194 [2019-11-20 10:45:43,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:43,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-20 10:45:43,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 173. [2019-11-20 10:45:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-20 10:45:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 265 transitions. [2019-11-20 10:45:43,429 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 265 transitions. Word has length 72 [2019-11-20 10:45:43,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:43,430 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 265 transitions. [2019-11-20 10:45:43,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:43,430 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 265 transitions. [2019-11-20 10:45:43,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 10:45:43,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:43,431 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:43,432 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:43,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:43,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1255219216, now seen corresponding path program 1 times [2019-11-20 10:45:43,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:43,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820506984] [2019-11-20 10:45:43,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:45:43,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820506984] [2019-11-20 10:45:43,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:43,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:43,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538325182] [2019-11-20 10:45:43,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:43,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:43,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:43,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:43,476 INFO L87 Difference]: Start difference. First operand 173 states and 265 transitions. Second operand 4 states. [2019-11-20 10:45:43,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:43,830 INFO L93 Difference]: Finished difference Result 347 states and 534 transitions. [2019-11-20 10:45:43,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:43,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-20 10:45:43,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:43,832 INFO L225 Difference]: With dead ends: 347 [2019-11-20 10:45:43,833 INFO L226 Difference]: Without dead ends: 193 [2019-11-20 10:45:43,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-20 10:45:43,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 173. [2019-11-20 10:45:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-20 10:45:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 264 transitions. [2019-11-20 10:45:43,839 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 264 transitions. Word has length 73 [2019-11-20 10:45:43,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:43,839 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 264 transitions. [2019-11-20 10:45:43,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:43,839 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 264 transitions. [2019-11-20 10:45:43,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 10:45:43,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:43,840 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:43,840 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:43,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:43,840 INFO L82 PathProgramCache]: Analyzing trace with hash 392695429, now seen corresponding path program 1 times [2019-11-20 10:45:43,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:43,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220246615] [2019-11-20 10:45:43,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:45:43,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220246615] [2019-11-20 10:45:43,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:43,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:43,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188533308] [2019-11-20 10:45:43,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:43,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:43,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:43,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:43,890 INFO L87 Difference]: Start difference. First operand 173 states and 264 transitions. Second operand 4 states. [2019-11-20 10:45:44,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:44,259 INFO L93 Difference]: Finished difference Result 345 states and 530 transitions. [2019-11-20 10:45:44,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:44,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-20 10:45:44,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:44,261 INFO L225 Difference]: With dead ends: 345 [2019-11-20 10:45:44,261 INFO L226 Difference]: Without dead ends: 191 [2019-11-20 10:45:44,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:44,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-20 10:45:44,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 173. [2019-11-20 10:45:44,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-20 10:45:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 263 transitions. [2019-11-20 10:45:44,267 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 263 transitions. Word has length 73 [2019-11-20 10:45:44,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:44,268 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 263 transitions. [2019-11-20 10:45:44,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:44,268 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 263 transitions. [2019-11-20 10:45:44,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 10:45:44,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:44,269 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:44,270 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:44,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:44,270 INFO L82 PathProgramCache]: Analyzing trace with hash -928157883, now seen corresponding path program 1 times [2019-11-20 10:45:44,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:44,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982524303] [2019-11-20 10:45:44,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:45:44,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982524303] [2019-11-20 10:45:44,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:44,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:44,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349604101] [2019-11-20 10:45:44,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:44,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:44,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:44,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:44,330 INFO L87 Difference]: Start difference. First operand 173 states and 263 transitions. Second operand 4 states. [2019-11-20 10:45:44,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:44,711 INFO L93 Difference]: Finished difference Result 344 states and 527 transitions. [2019-11-20 10:45:44,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:44,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-20 10:45:44,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:44,714 INFO L225 Difference]: With dead ends: 344 [2019-11-20 10:45:44,714 INFO L226 Difference]: Without dead ends: 190 [2019-11-20 10:45:44,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:44,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-20 10:45:44,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 173. [2019-11-20 10:45:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-20 10:45:44,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 262 transitions. [2019-11-20 10:45:44,720 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 262 transitions. Word has length 73 [2019-11-20 10:45:44,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:44,720 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 262 transitions. [2019-11-20 10:45:44,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:44,720 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 262 transitions. [2019-11-20 10:45:44,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 10:45:44,722 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:44,722 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:44,722 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:44,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:44,722 INFO L82 PathProgramCache]: Analyzing trace with hash 207708412, now seen corresponding path program 1 times [2019-11-20 10:45:44,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:44,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456861689] [2019-11-20 10:45:44,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:45:44,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456861689] [2019-11-20 10:45:44,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:44,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:44,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883911690] [2019-11-20 10:45:44,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:44,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:44,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:44,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:44,769 INFO L87 Difference]: Start difference. First operand 173 states and 262 transitions. Second operand 4 states. [2019-11-20 10:45:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:45,116 INFO L93 Difference]: Finished difference Result 344 states and 525 transitions. [2019-11-20 10:45:45,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:45,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-20 10:45:45,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:45,118 INFO L225 Difference]: With dead ends: 344 [2019-11-20 10:45:45,118 INFO L226 Difference]: Without dead ends: 190 [2019-11-20 10:45:45,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:45,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-20 10:45:45,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 173. [2019-11-20 10:45:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-20 10:45:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 261 transitions. [2019-11-20 10:45:45,125 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 261 transitions. Word has length 73 [2019-11-20 10:45:45,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:45,125 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 261 transitions. [2019-11-20 10:45:45,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 261 transitions. [2019-11-20 10:45:45,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 10:45:45,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:45,126 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:45,127 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:45,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:45,127 INFO L82 PathProgramCache]: Analyzing trace with hash 356483637, now seen corresponding path program 1 times [2019-11-20 10:45:45,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:45,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584944157] [2019-11-20 10:45:45,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:45:45,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584944157] [2019-11-20 10:45:45,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:45,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:45,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36900291] [2019-11-20 10:45:45,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:45,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:45,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:45,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:45,186 INFO L87 Difference]: Start difference. First operand 173 states and 261 transitions. Second operand 4 states. [2019-11-20 10:45:45,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:45,540 INFO L93 Difference]: Finished difference Result 344 states and 523 transitions. [2019-11-20 10:45:45,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:45,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-20 10:45:45,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:45,542 INFO L225 Difference]: With dead ends: 344 [2019-11-20 10:45:45,542 INFO L226 Difference]: Without dead ends: 190 [2019-11-20 10:45:45,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:45,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-20 10:45:45,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 173. [2019-11-20 10:45:45,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-20 10:45:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 260 transitions. [2019-11-20 10:45:45,547 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 260 transitions. Word has length 74 [2019-11-20 10:45:45,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:45,547 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 260 transitions. [2019-11-20 10:45:45,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:45,548 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 260 transitions. [2019-11-20 10:45:45,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 10:45:45,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:45,552 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:45,552 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:45,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:45,553 INFO L82 PathProgramCache]: Analyzing trace with hash -948220873, now seen corresponding path program 1 times [2019-11-20 10:45:45,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:45,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094765583] [2019-11-20 10:45:45,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:45:45,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094765583] [2019-11-20 10:45:45,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:45,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:45,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391971041] [2019-11-20 10:45:45,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:45,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:45,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:45,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:45,604 INFO L87 Difference]: Start difference. First operand 173 states and 260 transitions. Second operand 4 states. [2019-11-20 10:45:45,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:45,978 INFO L93 Difference]: Finished difference Result 344 states and 521 transitions. [2019-11-20 10:45:45,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:45,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-20 10:45:45,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:45,980 INFO L225 Difference]: With dead ends: 344 [2019-11-20 10:45:45,981 INFO L226 Difference]: Without dead ends: 190 [2019-11-20 10:45:45,981 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:45,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-20 10:45:45,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 173. [2019-11-20 10:45:45,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-20 10:45:45,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 259 transitions. [2019-11-20 10:45:45,987 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 259 transitions. Word has length 75 [2019-11-20 10:45:45,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:45,988 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 259 transitions. [2019-11-20 10:45:45,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:45,988 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 259 transitions. [2019-11-20 10:45:45,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 10:45:45,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:45,989 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:45,989 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:45,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:45,990 INFO L82 PathProgramCache]: Analyzing trace with hash -66156912, now seen corresponding path program 1 times [2019-11-20 10:45:45,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:45,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358591658] [2019-11-20 10:45:45,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:45:46,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358591658] [2019-11-20 10:45:46,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:46,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:46,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361752250] [2019-11-20 10:45:46,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:46,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:46,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:46,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:46,048 INFO L87 Difference]: Start difference. First operand 173 states and 259 transitions. Second operand 4 states. [2019-11-20 10:45:46,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:46,334 INFO L93 Difference]: Finished difference Result 334 states and 506 transitions. [2019-11-20 10:45:46,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:46,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-20 10:45:46,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:46,335 INFO L225 Difference]: With dead ends: 334 [2019-11-20 10:45:46,335 INFO L226 Difference]: Without dead ends: 180 [2019-11-20 10:45:46,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:46,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-20 10:45:46,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 173. [2019-11-20 10:45:46,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-20 10:45:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 258 transitions. [2019-11-20 10:45:46,341 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 258 transitions. Word has length 76 [2019-11-20 10:45:46,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:46,341 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 258 transitions. [2019-11-20 10:45:46,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:46,341 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 258 transitions. [2019-11-20 10:45:46,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 10:45:46,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:46,342 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:46,343 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:46,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:46,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1806658122, now seen corresponding path program 1 times [2019-11-20 10:45:46,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:46,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794323668] [2019-11-20 10:45:46,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:46,410 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:46,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794323668] [2019-11-20 10:45:46,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:46,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:46,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986000601] [2019-11-20 10:45:46,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:46,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:46,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:46,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:46,412 INFO L87 Difference]: Start difference. First operand 173 states and 258 transitions. Second operand 4 states. [2019-11-20 10:45:46,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:46,854 INFO L93 Difference]: Finished difference Result 438 states and 667 transitions. [2019-11-20 10:45:46,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:46,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-20 10:45:46,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:46,856 INFO L225 Difference]: With dead ends: 438 [2019-11-20 10:45:46,856 INFO L226 Difference]: Without dead ends: 284 [2019-11-20 10:45:46,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:46,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-20 10:45:46,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 214. [2019-11-20 10:45:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-11-20 10:45:46,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 332 transitions. [2019-11-20 10:45:46,864 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 332 transitions. Word has length 81 [2019-11-20 10:45:46,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:46,864 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 332 transitions. [2019-11-20 10:45:46,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:46,864 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 332 transitions. [2019-11-20 10:45:46,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 10:45:46,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:46,866 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:46,866 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:46,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:46,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1116501876, now seen corresponding path program 1 times [2019-11-20 10:45:46,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:46,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651068678] [2019-11-20 10:45:46,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:46,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651068678] [2019-11-20 10:45:46,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:46,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:46,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785419794] [2019-11-20 10:45:46,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:46,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:46,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:46,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:46,959 INFO L87 Difference]: Start difference. First operand 214 states and 332 transitions. Second operand 4 states. [2019-11-20 10:45:47,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:47,259 INFO L93 Difference]: Finished difference Result 459 states and 719 transitions. [2019-11-20 10:45:47,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:47,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-20 10:45:47,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:47,262 INFO L225 Difference]: With dead ends: 459 [2019-11-20 10:45:47,262 INFO L226 Difference]: Without dead ends: 264 [2019-11-20 10:45:47,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:47,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-11-20 10:45:47,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 238. [2019-11-20 10:45:47,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-11-20 10:45:47,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 374 transitions. [2019-11-20 10:45:47,271 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 374 transitions. Word has length 81 [2019-11-20 10:45:47,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:47,272 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 374 transitions. [2019-11-20 10:45:47,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:47,272 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 374 transitions. [2019-11-20 10:45:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 10:45:47,273 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:47,273 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:47,274 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:47,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:47,274 INFO L82 PathProgramCache]: Analyzing trace with hash -413023236, now seen corresponding path program 1 times [2019-11-20 10:45:47,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:47,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827110931] [2019-11-20 10:45:47,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:47,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827110931] [2019-11-20 10:45:47,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:47,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:47,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576939350] [2019-11-20 10:45:47,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:47,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:47,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:47,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:47,365 INFO L87 Difference]: Start difference. First operand 238 states and 374 transitions. Second operand 4 states. [2019-11-20 10:45:47,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:47,850 INFO L93 Difference]: Finished difference Result 520 states and 815 transitions. [2019-11-20 10:45:47,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:47,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-20 10:45:47,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:47,852 INFO L225 Difference]: With dead ends: 520 [2019-11-20 10:45:47,852 INFO L226 Difference]: Without dead ends: 301 [2019-11-20 10:45:47,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:47,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-20 10:45:47,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 239. [2019-11-20 10:45:47,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-11-20 10:45:47,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 375 transitions. [2019-11-20 10:45:47,860 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 375 transitions. Word has length 82 [2019-11-20 10:45:47,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:47,861 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 375 transitions. [2019-11-20 10:45:47,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:47,861 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 375 transitions. [2019-11-20 10:45:47,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-20 10:45:47,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:47,862 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:47,862 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:47,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:47,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1433746002, now seen corresponding path program 1 times [2019-11-20 10:45:47,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:47,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630849324] [2019-11-20 10:45:47,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:47,933 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:47,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630849324] [2019-11-20 10:45:47,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:47,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:47,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739215241] [2019-11-20 10:45:47,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:47,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:47,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:47,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:47,936 INFO L87 Difference]: Start difference. First operand 239 states and 375 transitions. Second operand 4 states. [2019-11-20 10:45:48,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:48,321 INFO L93 Difference]: Finished difference Result 521 states and 815 transitions. [2019-11-20 10:45:48,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:48,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-20 10:45:48,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:48,324 INFO L225 Difference]: With dead ends: 521 [2019-11-20 10:45:48,324 INFO L226 Difference]: Without dead ends: 301 [2019-11-20 10:45:48,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-20 10:45:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 239. [2019-11-20 10:45:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-11-20 10:45:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 374 transitions. [2019-11-20 10:45:48,331 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 374 transitions. Word has length 94 [2019-11-20 10:45:48,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:48,332 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 374 transitions. [2019-11-20 10:45:48,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:48,332 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 374 transitions. [2019-11-20 10:45:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-20 10:45:48,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:48,333 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:48,333 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:48,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:48,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1877646676, now seen corresponding path program 1 times [2019-11-20 10:45:48,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:48,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847123137] [2019-11-20 10:45:48,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:48,398 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:48,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847123137] [2019-11-20 10:45:48,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:48,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:48,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275880615] [2019-11-20 10:45:48,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:48,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:48,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:48,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:48,400 INFO L87 Difference]: Start difference. First operand 239 states and 374 transitions. Second operand 4 states. [2019-11-20 10:45:48,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:48,787 INFO L93 Difference]: Finished difference Result 485 states and 760 transitions. [2019-11-20 10:45:48,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:48,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-20 10:45:48,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:48,789 INFO L225 Difference]: With dead ends: 485 [2019-11-20 10:45:48,789 INFO L226 Difference]: Without dead ends: 265 [2019-11-20 10:45:48,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:48,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-11-20 10:45:48,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 239. [2019-11-20 10:45:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-11-20 10:45:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 373 transitions. [2019-11-20 10:45:48,796 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 373 transitions. Word has length 94 [2019-11-20 10:45:48,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:48,796 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 373 transitions. [2019-11-20 10:45:48,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 373 transitions. [2019-11-20 10:45:48,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 10:45:48,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:48,798 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:48,798 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:48,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:48,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1246404060, now seen corresponding path program 1 times [2019-11-20 10:45:48,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:48,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827964125] [2019-11-20 10:45:48,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:48,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827964125] [2019-11-20 10:45:48,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:48,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:48,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151620674] [2019-11-20 10:45:48,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:48,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:48,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:48,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:48,858 INFO L87 Difference]: Start difference. First operand 239 states and 373 transitions. Second operand 4 states. [2019-11-20 10:45:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:49,233 INFO L93 Difference]: Finished difference Result 520 states and 810 transitions. [2019-11-20 10:45:49,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:49,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-20 10:45:49,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:49,235 INFO L225 Difference]: With dead ends: 520 [2019-11-20 10:45:49,236 INFO L226 Difference]: Without dead ends: 300 [2019-11-20 10:45:49,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-20 10:45:49,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 239. [2019-11-20 10:45:49,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-11-20 10:45:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 372 transitions. [2019-11-20 10:45:49,242 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 372 transitions. Word has length 95 [2019-11-20 10:45:49,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:49,243 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 372 transitions. [2019-11-20 10:45:49,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:49,243 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 372 transitions. [2019-11-20 10:45:49,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 10:45:49,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:49,244 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:49,244 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:49,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:49,245 INFO L82 PathProgramCache]: Analyzing trace with hash 383880273, now seen corresponding path program 1 times [2019-11-20 10:45:49,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:49,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488874786] [2019-11-20 10:45:49,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:49,319 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:49,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488874786] [2019-11-20 10:45:49,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:49,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:49,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260926311] [2019-11-20 10:45:49,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:49,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:49,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:49,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:49,322 INFO L87 Difference]: Start difference. First operand 239 states and 372 transitions. Second operand 4 states. [2019-11-20 10:45:49,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:49,841 INFO L93 Difference]: Finished difference Result 518 states and 806 transitions. [2019-11-20 10:45:49,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:49,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-20 10:45:49,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:49,843 INFO L225 Difference]: With dead ends: 518 [2019-11-20 10:45:49,844 INFO L226 Difference]: Without dead ends: 298 [2019-11-20 10:45:49,844 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:49,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-20 10:45:49,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 239. [2019-11-20 10:45:49,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-11-20 10:45:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 371 transitions. [2019-11-20 10:45:49,850 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 371 transitions. Word has length 95 [2019-11-20 10:45:49,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:49,850 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 371 transitions. [2019-11-20 10:45:49,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:49,850 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 371 transitions. [2019-11-20 10:45:49,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 10:45:49,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:49,851 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:49,852 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:49,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:49,852 INFO L82 PathProgramCache]: Analyzing trace with hash -936973039, now seen corresponding path program 1 times [2019-11-20 10:45:49,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:49,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735579865] [2019-11-20 10:45:49,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:49,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735579865] [2019-11-20 10:45:49,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:49,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:49,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870995999] [2019-11-20 10:45:49,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:49,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:49,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:49,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:49,918 INFO L87 Difference]: Start difference. First operand 239 states and 371 transitions. Second operand 4 states. [2019-11-20 10:45:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:50,342 INFO L93 Difference]: Finished difference Result 517 states and 803 transitions. [2019-11-20 10:45:50,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:50,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-20 10:45:50,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:50,344 INFO L225 Difference]: With dead ends: 517 [2019-11-20 10:45:50,344 INFO L226 Difference]: Without dead ends: 297 [2019-11-20 10:45:50,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:50,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-20 10:45:50,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 239. [2019-11-20 10:45:50,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-11-20 10:45:50,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 370 transitions. [2019-11-20 10:45:50,354 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 370 transitions. Word has length 95 [2019-11-20 10:45:50,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:50,354 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 370 transitions. [2019-11-20 10:45:50,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 370 transitions. [2019-11-20 10:45:50,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 10:45:50,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:50,356 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:50,356 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:50,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:50,356 INFO L82 PathProgramCache]: Analyzing trace with hash 198893256, now seen corresponding path program 1 times [2019-11-20 10:45:50,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:50,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880032601] [2019-11-20 10:45:50,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 10:45:50,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880032601] [2019-11-20 10:45:50,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:50,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 10:45:50,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578878707] [2019-11-20 10:45:50,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:45:50,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:50,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:45:50,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:50,455 INFO L87 Difference]: Start difference. First operand 239 states and 370 transitions. Second operand 5 states. [2019-11-20 10:45:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:51,000 INFO L93 Difference]: Finished difference Result 480 states and 748 transitions. [2019-11-20 10:45:51,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:45:51,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-20 10:45:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:51,003 INFO L225 Difference]: With dead ends: 480 [2019-11-20 10:45:51,003 INFO L226 Difference]: Without dead ends: 260 [2019-11-20 10:45:51,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:45:51,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-20 10:45:51,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2019-11-20 10:45:51,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-20 10:45:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 396 transitions. [2019-11-20 10:45:51,013 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 396 transitions. Word has length 95 [2019-11-20 10:45:51,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:51,013 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 396 transitions. [2019-11-20 10:45:51,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:45:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 396 transitions. [2019-11-20 10:45:51,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 10:45:51,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:51,015 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:51,015 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:51,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:51,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1259899279, now seen corresponding path program 1 times [2019-11-20 10:45:51,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:51,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275556910] [2019-11-20 10:45:51,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:51,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275556910] [2019-11-20 10:45:51,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:51,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:51,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248939036] [2019-11-20 10:45:51,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:51,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:51,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:51,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:51,083 INFO L87 Difference]: Start difference. First operand 259 states and 396 transitions. Second operand 4 states. [2019-11-20 10:45:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:51,462 INFO L93 Difference]: Finished difference Result 522 states and 800 transitions. [2019-11-20 10:45:51,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:51,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-20 10:45:51,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:51,465 INFO L225 Difference]: With dead ends: 522 [2019-11-20 10:45:51,465 INFO L226 Difference]: Without dead ends: 282 [2019-11-20 10:45:51,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-20 10:45:51,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 259. [2019-11-20 10:45:51,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-20 10:45:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 395 transitions. [2019-11-20 10:45:51,473 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 395 transitions. Word has length 95 [2019-11-20 10:45:51,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:51,473 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 395 transitions. [2019-11-20 10:45:51,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:51,473 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 395 transitions. [2019-11-20 10:45:51,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 10:45:51,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:51,475 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:51,475 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:51,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:51,475 INFO L82 PathProgramCache]: Analyzing trace with hash -60954033, now seen corresponding path program 1 times [2019-11-20 10:45:51,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:51,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626765228] [2019-11-20 10:45:51,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:51,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626765228] [2019-11-20 10:45:51,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:51,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:51,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782910944] [2019-11-20 10:45:51,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:51,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:51,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:51,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:51,540 INFO L87 Difference]: Start difference. First operand 259 states and 395 transitions. Second operand 4 states. [2019-11-20 10:45:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:51,922 INFO L93 Difference]: Finished difference Result 521 states and 797 transitions. [2019-11-20 10:45:51,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:51,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-20 10:45:51,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:51,924 INFO L225 Difference]: With dead ends: 521 [2019-11-20 10:45:51,924 INFO L226 Difference]: Without dead ends: 281 [2019-11-20 10:45:51,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:51,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-20 10:45:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 259. [2019-11-20 10:45:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-20 10:45:51,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 394 transitions. [2019-11-20 10:45:51,933 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 394 transitions. Word has length 95 [2019-11-20 10:45:51,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:51,934 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 394 transitions. [2019-11-20 10:45:51,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:51,934 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 394 transitions. [2019-11-20 10:45:51,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 10:45:51,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:51,936 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:51,936 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:51,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:51,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1696535082, now seen corresponding path program 1 times [2019-11-20 10:45:51,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:51,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436297650] [2019-11-20 10:45:51,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:51,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436297650] [2019-11-20 10:45:51,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:51,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:51,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527589826] [2019-11-20 10:45:51,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:51,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:51,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:51,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:51,996 INFO L87 Difference]: Start difference. First operand 259 states and 394 transitions. Second operand 4 states. [2019-11-20 10:45:52,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:52,483 INFO L93 Difference]: Finished difference Result 557 states and 848 transitions. [2019-11-20 10:45:52,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:52,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 10:45:52,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:52,486 INFO L225 Difference]: With dead ends: 557 [2019-11-20 10:45:52,486 INFO L226 Difference]: Without dead ends: 317 [2019-11-20 10:45:52,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:52,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-11-20 10:45:52,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 259. [2019-11-20 10:45:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-20 10:45:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2019-11-20 10:45:52,495 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 96 [2019-11-20 10:45:52,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:52,495 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2019-11-20 10:45:52,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:52,496 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2019-11-20 10:45:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 10:45:52,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:52,497 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:52,497 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:52,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:52,497 INFO L82 PathProgramCache]: Analyzing trace with hash -309749672, now seen corresponding path program 1 times [2019-11-20 10:45:52,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:52,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649518722] [2019-11-20 10:45:52,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:52,584 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:52,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649518722] [2019-11-20 10:45:52,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:52,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:52,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432835025] [2019-11-20 10:45:52,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:52,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:52,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:52,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:52,586 INFO L87 Difference]: Start difference. First operand 259 states and 393 transitions. Second operand 4 states. [2019-11-20 10:45:52,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:52,980 INFO L93 Difference]: Finished difference Result 521 states and 793 transitions. [2019-11-20 10:45:52,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:52,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 10:45:52,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:52,982 INFO L225 Difference]: With dead ends: 521 [2019-11-20 10:45:52,983 INFO L226 Difference]: Without dead ends: 281 [2019-11-20 10:45:52,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:52,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-20 10:45:52,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 259. [2019-11-20 10:45:52,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-20 10:45:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 392 transitions. [2019-11-20 10:45:52,992 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 392 transitions. Word has length 96 [2019-11-20 10:45:52,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:52,992 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 392 transitions. [2019-11-20 10:45:52,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:52,992 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 392 transitions. [2019-11-20 10:45:52,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 10:45:52,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:52,993 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:52,994 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:52,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:52,994 INFO L82 PathProgramCache]: Analyzing trace with hash -987630891, now seen corresponding path program 1 times [2019-11-20 10:45:52,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:52,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443473486] [2019-11-20 10:45:52,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:53,047 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:53,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443473486] [2019-11-20 10:45:53,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:53,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:53,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850530002] [2019-11-20 10:45:53,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:53,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:53,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:53,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:53,050 INFO L87 Difference]: Start difference. First operand 259 states and 392 transitions. Second operand 4 states. [2019-11-20 10:45:53,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:53,484 INFO L93 Difference]: Finished difference Result 557 states and 844 transitions. [2019-11-20 10:45:53,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:53,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 10:45:53,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:53,486 INFO L225 Difference]: With dead ends: 557 [2019-11-20 10:45:53,487 INFO L226 Difference]: Without dead ends: 317 [2019-11-20 10:45:53,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:53,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-11-20 10:45:53,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 259. [2019-11-20 10:45:53,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-20 10:45:53,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 391 transitions. [2019-11-20 10:45:53,496 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 391 transitions. Word has length 97 [2019-11-20 10:45:53,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:53,496 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 391 transitions. [2019-11-20 10:45:53,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:53,497 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 391 transitions. [2019-11-20 10:45:53,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 10:45:53,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:53,498 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:53,498 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:53,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:53,498 INFO L82 PathProgramCache]: Analyzing trace with hash -946956141, now seen corresponding path program 1 times [2019-11-20 10:45:53,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:53,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176227195] [2019-11-20 10:45:53,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:53,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176227195] [2019-11-20 10:45:53,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:53,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:53,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272960235] [2019-11-20 10:45:53,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:53,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:53,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:53,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:53,553 INFO L87 Difference]: Start difference. First operand 259 states and 391 transitions. Second operand 4 states. [2019-11-20 10:45:53,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:53,912 INFO L93 Difference]: Finished difference Result 521 states and 789 transitions. [2019-11-20 10:45:53,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:53,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 10:45:53,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:53,914 INFO L225 Difference]: With dead ends: 521 [2019-11-20 10:45:53,914 INFO L226 Difference]: Without dead ends: 281 [2019-11-20 10:45:53,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:53,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-20 10:45:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 259. [2019-11-20 10:45:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-20 10:45:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 390 transitions. [2019-11-20 10:45:53,922 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 390 transitions. Word has length 97 [2019-11-20 10:45:53,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:53,922 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 390 transitions. [2019-11-20 10:45:53,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 390 transitions. [2019-11-20 10:45:53,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 10:45:53,923 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:53,923 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:53,923 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:53,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:53,923 INFO L82 PathProgramCache]: Analyzing trace with hash 778325243, now seen corresponding path program 1 times [2019-11-20 10:45:53,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:53,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048273675] [2019-11-20 10:45:53,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:53,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048273675] [2019-11-20 10:45:53,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:53,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:53,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961025560] [2019-11-20 10:45:53,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:53,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:53,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:53,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:53,975 INFO L87 Difference]: Start difference. First operand 259 states and 390 transitions. Second operand 4 states. [2019-11-20 10:45:54,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:54,428 INFO L93 Difference]: Finished difference Result 557 states and 840 transitions. [2019-11-20 10:45:54,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:54,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 10:45:54,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:54,430 INFO L225 Difference]: With dead ends: 557 [2019-11-20 10:45:54,430 INFO L226 Difference]: Without dead ends: 317 [2019-11-20 10:45:54,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:54,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-11-20 10:45:54,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 259. [2019-11-20 10:45:54,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-20 10:45:54,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 389 transitions. [2019-11-20 10:45:54,438 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 389 transitions. Word has length 98 [2019-11-20 10:45:54,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:54,439 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 389 transitions. [2019-11-20 10:45:54,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:54,439 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 389 transitions. [2019-11-20 10:45:54,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 10:45:54,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:54,440 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:54,440 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:54,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:54,441 INFO L82 PathProgramCache]: Analyzing trace with hash 2039242493, now seen corresponding path program 1 times [2019-11-20 10:45:54,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:54,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618895839] [2019-11-20 10:45:54,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:54,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618895839] [2019-11-20 10:45:54,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:54,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:54,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886400355] [2019-11-20 10:45:54,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:54,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:54,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:54,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:54,491 INFO L87 Difference]: Start difference. First operand 259 states and 389 transitions. Second operand 4 states. [2019-11-20 10:45:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:54,862 INFO L93 Difference]: Finished difference Result 521 states and 785 transitions. [2019-11-20 10:45:54,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:54,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 10:45:54,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:54,864 INFO L225 Difference]: With dead ends: 521 [2019-11-20 10:45:54,864 INFO L226 Difference]: Without dead ends: 281 [2019-11-20 10:45:54,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:54,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-20 10:45:54,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 259. [2019-11-20 10:45:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-20 10:45:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 388 transitions. [2019-11-20 10:45:54,872 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 388 transitions. Word has length 98 [2019-11-20 10:45:54,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:54,872 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 388 transitions. [2019-11-20 10:45:54,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 388 transitions. [2019-11-20 10:45:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 10:45:54,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:54,874 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:54,874 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:54,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:54,874 INFO L82 PathProgramCache]: Analyzing trace with hash 953153242, now seen corresponding path program 1 times [2019-11-20 10:45:54,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:54,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064770448] [2019-11-20 10:45:54,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:54,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064770448] [2019-11-20 10:45:54,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:54,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:54,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557846726] [2019-11-20 10:45:54,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:54,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:54,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:54,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:54,930 INFO L87 Difference]: Start difference. First operand 259 states and 388 transitions. Second operand 4 states. [2019-11-20 10:45:55,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:55,391 INFO L93 Difference]: Finished difference Result 547 states and 824 transitions. [2019-11-20 10:45:55,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:55,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-20 10:45:55,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:55,393 INFO L225 Difference]: With dead ends: 547 [2019-11-20 10:45:55,394 INFO L226 Difference]: Without dead ends: 307 [2019-11-20 10:45:55,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:55,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-20 10:45:55,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 259. [2019-11-20 10:45:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-20 10:45:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 387 transitions. [2019-11-20 10:45:55,402 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 387 transitions. Word has length 99 [2019-11-20 10:45:55,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:55,403 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 387 transitions. [2019-11-20 10:45:55,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:55,403 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 387 transitions. [2019-11-20 10:45:55,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 10:45:55,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:55,404 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:55,404 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:55,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:55,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1386882328, now seen corresponding path program 1 times [2019-11-20 10:45:55,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:55,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710596364] [2019-11-20 10:45:55,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:55,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710596364] [2019-11-20 10:45:55,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:55,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:55,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716012526] [2019-11-20 10:45:55,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:55,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:55,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:55,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:55,477 INFO L87 Difference]: Start difference. First operand 259 states and 387 transitions. Second operand 4 states. [2019-11-20 10:45:55,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:55,811 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2019-11-20 10:45:55,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:55,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-20 10:45:55,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:55,813 INFO L225 Difference]: With dead ends: 511 [2019-11-20 10:45:55,813 INFO L226 Difference]: Without dead ends: 271 [2019-11-20 10:45:55,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:55,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-20 10:45:55,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 259. [2019-11-20 10:45:55,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-20 10:45:55,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 386 transitions. [2019-11-20 10:45:55,824 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 386 transitions. Word has length 99 [2019-11-20 10:45:55,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:55,824 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 386 transitions. [2019-11-20 10:45:55,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:55,825 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 386 transitions. [2019-11-20 10:45:55,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 10:45:55,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:55,826 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:55,826 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:55,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:55,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1409187564, now seen corresponding path program 1 times [2019-11-20 10:45:55,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:55,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977861783] [2019-11-20 10:45:55,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:55,922 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:55,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977861783] [2019-11-20 10:45:55,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:55,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:55,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531139584] [2019-11-20 10:45:55,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:55,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:55,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:55,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:55,924 INFO L87 Difference]: Start difference. First operand 259 states and 386 transitions. Second operand 4 states. [2019-11-20 10:45:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:56,403 INFO L93 Difference]: Finished difference Result 547 states and 820 transitions. [2019-11-20 10:45:56,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:56,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-20 10:45:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:56,405 INFO L225 Difference]: With dead ends: 547 [2019-11-20 10:45:56,405 INFO L226 Difference]: Without dead ends: 307 [2019-11-20 10:45:56,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:56,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-20 10:45:56,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 259. [2019-11-20 10:45:56,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-20 10:45:56,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 385 transitions. [2019-11-20 10:45:56,417 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 385 transitions. Word has length 103 [2019-11-20 10:45:56,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:56,417 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 385 transitions. [2019-11-20 10:45:56,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:56,417 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 385 transitions. [2019-11-20 10:45:56,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 10:45:56,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:56,419 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:56,419 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:56,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:56,419 INFO L82 PathProgramCache]: Analyzing trace with hash -729915310, now seen corresponding path program 1 times [2019-11-20 10:45:56,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:56,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432780527] [2019-11-20 10:45:56,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:45:56,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432780527] [2019-11-20 10:45:56,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:56,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:56,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354824147] [2019-11-20 10:45:56,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:56,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:56,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:56,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:56,491 INFO L87 Difference]: Start difference. First operand 259 states and 385 transitions. Second operand 4 states. [2019-11-20 10:45:56,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:56,874 INFO L93 Difference]: Finished difference Result 552 states and 829 transitions. [2019-11-20 10:45:56,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:56,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-20 10:45:56,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:56,877 INFO L225 Difference]: With dead ends: 552 [2019-11-20 10:45:56,877 INFO L226 Difference]: Without dead ends: 312 [2019-11-20 10:45:56,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:56,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-20 10:45:56,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 285. [2019-11-20 10:45:56,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-20 10:45:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 430 transitions. [2019-11-20 10:45:56,887 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 430 transitions. Word has length 103 [2019-11-20 10:45:56,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:56,887 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 430 transitions. [2019-11-20 10:45:56,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:56,887 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 430 transitions. [2019-11-20 10:45:56,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 10:45:56,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:56,890 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:56,890 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:56,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:56,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1317661803, now seen corresponding path program 1 times [2019-11-20 10:45:56,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:56,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228566011] [2019-11-20 10:45:56,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:56,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228566011] [2019-11-20 10:45:56,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:56,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:56,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455398510] [2019-11-20 10:45:56,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:56,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:56,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:56,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:56,966 INFO L87 Difference]: Start difference. First operand 285 states and 430 transitions. Second operand 4 states. [2019-11-20 10:45:57,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:57,459 INFO L93 Difference]: Finished difference Result 599 states and 908 transitions. [2019-11-20 10:45:57,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:57,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-20 10:45:57,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:57,462 INFO L225 Difference]: With dead ends: 599 [2019-11-20 10:45:57,462 INFO L226 Difference]: Without dead ends: 333 [2019-11-20 10:45:57,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:57,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-11-20 10:45:57,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 285. [2019-11-20 10:45:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-20 10:45:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 429 transitions. [2019-11-20 10:45:57,472 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 429 transitions. Word has length 106 [2019-11-20 10:45:57,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:57,473 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 429 transitions. [2019-11-20 10:45:57,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:57,473 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 429 transitions. [2019-11-20 10:45:57,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 10:45:57,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:57,475 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:57,475 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:57,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:57,475 INFO L82 PathProgramCache]: Analyzing trace with hash -449262892, now seen corresponding path program 1 times [2019-11-20 10:45:57,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:57,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42236234] [2019-11-20 10:45:57,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:57,547 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:57,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42236234] [2019-11-20 10:45:57,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:57,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:57,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063107195] [2019-11-20 10:45:57,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:57,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:57,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:57,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:57,549 INFO L87 Difference]: Start difference. First operand 285 states and 429 transitions. Second operand 4 states. [2019-11-20 10:45:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:58,017 INFO L93 Difference]: Finished difference Result 591 states and 893 transitions. [2019-11-20 10:45:58,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:58,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-20 10:45:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:58,020 INFO L225 Difference]: With dead ends: 591 [2019-11-20 10:45:58,020 INFO L226 Difference]: Without dead ends: 325 [2019-11-20 10:45:58,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-11-20 10:45:58,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-11-20 10:45:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-20 10:45:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 428 transitions. [2019-11-20 10:45:58,032 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 428 transitions. Word has length 107 [2019-11-20 10:45:58,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:58,033 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 428 transitions. [2019-11-20 10:45:58,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:58,033 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 428 transitions. [2019-11-20 10:45:58,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 10:45:58,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:58,034 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:58,035 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:58,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:58,035 INFO L82 PathProgramCache]: Analyzing trace with hash -2126978123, now seen corresponding path program 1 times [2019-11-20 10:45:58,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:58,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99207583] [2019-11-20 10:45:58,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:58,099 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:58,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99207583] [2019-11-20 10:45:58,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:58,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:58,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095487099] [2019-11-20 10:45:58,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:58,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:58,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:58,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:58,101 INFO L87 Difference]: Start difference. First operand 285 states and 428 transitions. Second operand 4 states. [2019-11-20 10:45:58,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:58,549 INFO L93 Difference]: Finished difference Result 591 states and 891 transitions. [2019-11-20 10:45:58,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:58,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-20 10:45:58,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:58,551 INFO L225 Difference]: With dead ends: 591 [2019-11-20 10:45:58,552 INFO L226 Difference]: Without dead ends: 325 [2019-11-20 10:45:58,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:58,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-11-20 10:45:58,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-11-20 10:45:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-20 10:45:58,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 427 transitions. [2019-11-20 10:45:58,562 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 427 transitions. Word has length 108 [2019-11-20 10:45:58,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:58,562 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 427 transitions. [2019-11-20 10:45:58,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:58,563 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 427 transitions. [2019-11-20 10:45:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 10:45:58,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:58,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:58,564 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:58,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:58,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1091839583, now seen corresponding path program 1 times [2019-11-20 10:45:58,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:58,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686613632] [2019-11-20 10:45:58,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:58,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686613632] [2019-11-20 10:45:58,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:58,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:58,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945441778] [2019-11-20 10:45:58,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:58,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:58,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:58,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:58,634 INFO L87 Difference]: Start difference. First operand 285 states and 427 transitions. Second operand 4 states. [2019-11-20 10:45:59,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:59,050 INFO L93 Difference]: Finished difference Result 591 states and 889 transitions. [2019-11-20 10:45:59,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:59,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-11-20 10:45:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:59,053 INFO L225 Difference]: With dead ends: 591 [2019-11-20 10:45:59,053 INFO L226 Difference]: Without dead ends: 325 [2019-11-20 10:45:59,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:59,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-11-20 10:45:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-11-20 10:45:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-20 10:45:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 426 transitions. [2019-11-20 10:45:59,064 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 426 transitions. Word has length 109 [2019-11-20 10:45:59,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:59,065 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 426 transitions. [2019-11-20 10:45:59,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:59,066 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 426 transitions. [2019-11-20 10:45:59,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 10:45:59,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:59,067 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:59,067 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:59,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:59,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1287280684, now seen corresponding path program 1 times [2019-11-20 10:45:59,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:59,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425162898] [2019-11-20 10:45:59,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:59,180 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:59,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425162898] [2019-11-20 10:45:59,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:59,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:59,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854401581] [2019-11-20 10:45:59,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:59,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:59,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:59,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:59,182 INFO L87 Difference]: Start difference. First operand 285 states and 426 transitions. Second operand 4 states. [2019-11-20 10:45:59,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:45:59,604 INFO L93 Difference]: Finished difference Result 589 states and 885 transitions. [2019-11-20 10:45:59,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:45:59,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-11-20 10:45:59,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:45:59,606 INFO L225 Difference]: With dead ends: 589 [2019-11-20 10:45:59,607 INFO L226 Difference]: Without dead ends: 323 [2019-11-20 10:45:59,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:45:59,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-20 10:45:59,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 285. [2019-11-20 10:45:59,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-20 10:45:59,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 425 transitions. [2019-11-20 10:45:59,616 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 425 transitions. Word has length 109 [2019-11-20 10:45:59,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:45:59,617 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 425 transitions. [2019-11-20 10:45:59,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:45:59,617 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 425 transitions. [2019-11-20 10:45:59,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 10:45:59,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:45:59,618 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:45:59,618 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:45:59,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:45:59,619 INFO L82 PathProgramCache]: Analyzing trace with hash -576923808, now seen corresponding path program 1 times [2019-11-20 10:45:59,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:45:59,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702212934] [2019-11-20 10:45:59,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:45:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:45:59,680 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:45:59,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702212934] [2019-11-20 10:45:59,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:45:59,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:45:59,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774308780] [2019-11-20 10:45:59,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:45:59,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:45:59,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:45:59,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:45:59,683 INFO L87 Difference]: Start difference. First operand 285 states and 425 transitions. Second operand 4 states. [2019-11-20 10:46:00,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:00,000 INFO L93 Difference]: Finished difference Result 587 states and 880 transitions. [2019-11-20 10:46:00,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:00,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-20 10:46:00,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:00,002 INFO L225 Difference]: With dead ends: 587 [2019-11-20 10:46:00,003 INFO L226 Difference]: Without dead ends: 321 [2019-11-20 10:46:00,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:00,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-20 10:46:00,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 285. [2019-11-20 10:46:00,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-20 10:46:00,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 424 transitions. [2019-11-20 10:46:00,012 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 424 transitions. Word has length 110 [2019-11-20 10:46:00,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:00,012 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 424 transitions. [2019-11-20 10:46:00,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:00,013 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 424 transitions. [2019-11-20 10:46:00,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 10:46:00,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:00,014 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:00,014 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:00,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:00,015 INFO L82 PathProgramCache]: Analyzing trace with hash 685628119, now seen corresponding path program 1 times [2019-11-20 10:46:00,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:00,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682375297] [2019-11-20 10:46:00,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:46:00,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682375297] [2019-11-20 10:46:00,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:00,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:00,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498533631] [2019-11-20 10:46:00,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:00,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:00,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:00,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:00,094 INFO L87 Difference]: Start difference. First operand 285 states and 424 transitions. Second operand 4 states. [2019-11-20 10:46:00,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:00,385 INFO L93 Difference]: Finished difference Result 584 states and 874 transitions. [2019-11-20 10:46:00,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:00,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-20 10:46:00,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:00,387 INFO L225 Difference]: With dead ends: 584 [2019-11-20 10:46:00,387 INFO L226 Difference]: Without dead ends: 318 [2019-11-20 10:46:00,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:00,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-20 10:46:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 285. [2019-11-20 10:46:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-20 10:46:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 423 transitions. [2019-11-20 10:46:00,396 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 423 transitions. Word has length 110 [2019-11-20 10:46:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:00,396 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 423 transitions. [2019-11-20 10:46:00,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:00,397 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 423 transitions. [2019-11-20 10:46:00,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 10:46:00,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:00,398 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:00,398 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:00,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:00,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1612775450, now seen corresponding path program 1 times [2019-11-20 10:46:00,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:00,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483440159] [2019-11-20 10:46:00,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:46:00,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483440159] [2019-11-20 10:46:00,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:00,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:00,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964162380] [2019-11-20 10:46:00,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:00,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:00,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:00,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:00,473 INFO L87 Difference]: Start difference. First operand 285 states and 423 transitions. Second operand 4 states. [2019-11-20 10:46:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:00,768 INFO L93 Difference]: Finished difference Result 584 states and 872 transitions. [2019-11-20 10:46:00,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:00,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-20 10:46:00,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:00,770 INFO L225 Difference]: With dead ends: 584 [2019-11-20 10:46:00,770 INFO L226 Difference]: Without dead ends: 318 [2019-11-20 10:46:00,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:00,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-20 10:46:00,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 285. [2019-11-20 10:46:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-20 10:46:00,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 422 transitions. [2019-11-20 10:46:00,779 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 422 transitions. Word has length 113 [2019-11-20 10:46:00,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:00,779 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 422 transitions. [2019-11-20 10:46:00,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:00,779 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 422 transitions. [2019-11-20 10:46:00,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 10:46:00,780 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:00,780 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:00,781 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:00,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:00,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1906443136, now seen corresponding path program 1 times [2019-11-20 10:46:00,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:00,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557549161] [2019-11-20 10:46:00,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:00,856 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:46:00,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557549161] [2019-11-20 10:46:00,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:00,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:00,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563300706] [2019-11-20 10:46:00,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:00,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:00,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:00,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:00,858 INFO L87 Difference]: Start difference. First operand 285 states and 422 transitions. Second operand 4 states. [2019-11-20 10:46:01,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:01,206 INFO L93 Difference]: Finished difference Result 578 states and 861 transitions. [2019-11-20 10:46:01,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:01,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-20 10:46:01,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:01,208 INFO L225 Difference]: With dead ends: 578 [2019-11-20 10:46:01,208 INFO L226 Difference]: Without dead ends: 312 [2019-11-20 10:46:01,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-11-20 10:46:01,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-20 10:46:01,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 285. [2019-11-20 10:46:01,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-20 10:46:01,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 421 transitions. [2019-11-20 10:46:01,217 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 421 transitions. Word has length 114 [2019-11-20 10:46:01,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:01,218 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 421 transitions. [2019-11-20 10:46:01,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:01,218 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 421 transitions. [2019-11-20 10:46:01,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 10:46:01,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:01,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:01,219 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:01,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:01,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1845596870, now seen corresponding path program 1 times [2019-11-20 10:46:01,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:01,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624922005] [2019-11-20 10:46:01,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:46:01,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624922005] [2019-11-20 10:46:01,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:01,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:01,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106136765] [2019-11-20 10:46:01,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:01,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:01,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:01,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:01,293 INFO L87 Difference]: Start difference. First operand 285 states and 421 transitions. Second operand 4 states. [2019-11-20 10:46:01,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:01,745 INFO L93 Difference]: Finished difference Result 578 states and 859 transitions. [2019-11-20 10:46:01,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:01,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-20 10:46:01,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:01,747 INFO L225 Difference]: With dead ends: 578 [2019-11-20 10:46:01,747 INFO L226 Difference]: Without dead ends: 312 [2019-11-20 10:46:01,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:01,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-20 10:46:01,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 285. [2019-11-20 10:46:01,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-20 10:46:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 420 transitions. [2019-11-20 10:46:01,756 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 420 transitions. Word has length 114 [2019-11-20 10:46:01,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:01,756 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 420 transitions. [2019-11-20 10:46:01,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 420 transitions. [2019-11-20 10:46:01,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-20 10:46:01,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:01,758 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:01,758 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:01,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:01,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1499113856, now seen corresponding path program 1 times [2019-11-20 10:46:01,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:01,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094382618] [2019-11-20 10:46:01,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:46:01,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094382618] [2019-11-20 10:46:01,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:01,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:01,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490996622] [2019-11-20 10:46:01,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:01,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:01,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:01,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:01,827 INFO L87 Difference]: Start difference. First operand 285 states and 420 transitions. Second operand 4 states. [2019-11-20 10:46:02,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:02,133 INFO L93 Difference]: Finished difference Result 575 states and 853 transitions. [2019-11-20 10:46:02,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:02,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-20 10:46:02,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:02,136 INFO L225 Difference]: With dead ends: 575 [2019-11-20 10:46:02,136 INFO L226 Difference]: Without dead ends: 309 [2019-11-20 10:46:02,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:02,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-20 10:46:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 285. [2019-11-20 10:46:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-20 10:46:02,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 419 transitions. [2019-11-20 10:46:02,146 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 419 transitions. Word has length 115 [2019-11-20 10:46:02,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:02,147 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 419 transitions. [2019-11-20 10:46:02,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:02,147 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 419 transitions. [2019-11-20 10:46:02,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:46:02,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:02,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:02,149 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:02,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:02,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1831341134, now seen corresponding path program 1 times [2019-11-20 10:46:02,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:02,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555734055] [2019-11-20 10:46:02,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:46:02,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555734055] [2019-11-20 10:46:02,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:02,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:02,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627373319] [2019-11-20 10:46:02,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:02,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:02,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:02,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:02,278 INFO L87 Difference]: Start difference. First operand 285 states and 419 transitions. Second operand 4 states. [2019-11-20 10:46:02,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:02,705 INFO L93 Difference]: Finished difference Result 575 states and 851 transitions. [2019-11-20 10:46:02,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:02,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-20 10:46:02,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:02,707 INFO L225 Difference]: With dead ends: 575 [2019-11-20 10:46:02,707 INFO L226 Difference]: Without dead ends: 309 [2019-11-20 10:46:02,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:02,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-20 10:46:02,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 285. [2019-11-20 10:46:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-20 10:46:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 418 transitions. [2019-11-20 10:46:02,716 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 418 transitions. Word has length 116 [2019-11-20 10:46:02,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:02,717 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 418 transitions. [2019-11-20 10:46:02,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:02,717 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 418 transitions. [2019-11-20 10:46:02,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:46:02,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:02,718 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:02,719 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:02,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:02,719 INFO L82 PathProgramCache]: Analyzing trace with hash 715558198, now seen corresponding path program 1 times [2019-11-20 10:46:02,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:02,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928307020] [2019-11-20 10:46:02,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-20 10:46:02,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928307020] [2019-11-20 10:46:02,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:02,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:02,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977521724] [2019-11-20 10:46:02,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:02,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:02,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:02,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:02,784 INFO L87 Difference]: Start difference. First operand 285 states and 418 transitions. Second operand 4 states. [2019-11-20 10:46:03,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:03,255 INFO L93 Difference]: Finished difference Result 623 states and 926 transitions. [2019-11-20 10:46:03,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:03,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-20 10:46:03,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:03,258 INFO L225 Difference]: With dead ends: 623 [2019-11-20 10:46:03,258 INFO L226 Difference]: Without dead ends: 357 [2019-11-20 10:46:03,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:03,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-20 10:46:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 317. [2019-11-20 10:46:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-11-20 10:46:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 475 transitions. [2019-11-20 10:46:03,269 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 475 transitions. Word has length 116 [2019-11-20 10:46:03,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:03,269 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 475 transitions. [2019-11-20 10:46:03,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 475 transitions. [2019-11-20 10:46:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 10:46:03,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:03,271 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:03,271 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:03,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:03,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1423246104, now seen corresponding path program 1 times [2019-11-20 10:46:03,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:03,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906231718] [2019-11-20 10:46:03,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:46:03,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906231718] [2019-11-20 10:46:03,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:03,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:03,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115167026] [2019-11-20 10:46:03,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:03,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:03,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:03,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:03,346 INFO L87 Difference]: Start difference. First operand 317 states and 475 transitions. Second operand 4 states. [2019-11-20 10:46:03,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:03,736 INFO L93 Difference]: Finished difference Result 636 states and 959 transitions. [2019-11-20 10:46:03,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:03,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-20 10:46:03,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:03,739 INFO L225 Difference]: With dead ends: 636 [2019-11-20 10:46:03,739 INFO L226 Difference]: Without dead ends: 338 [2019-11-20 10:46:03,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:03,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-20 10:46:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 317. [2019-11-20 10:46:03,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-11-20 10:46:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 474 transitions. [2019-11-20 10:46:03,750 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 474 transitions. Word has length 117 [2019-11-20 10:46:03,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:03,750 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 474 transitions. [2019-11-20 10:46:03,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:03,750 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 474 transitions. [2019-11-20 10:46:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 10:46:03,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:03,752 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:03,752 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:03,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:03,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1725958483, now seen corresponding path program 1 times [2019-11-20 10:46:03,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:03,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396019540] [2019-11-20 10:46:03,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:03,820 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:46:03,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396019540] [2019-11-20 10:46:03,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:03,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:03,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814167298] [2019-11-20 10:46:03,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:03,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:03,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:03,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:03,823 INFO L87 Difference]: Start difference. First operand 317 states and 474 transitions. Second operand 4 states. [2019-11-20 10:46:04,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:04,359 INFO L93 Difference]: Finished difference Result 723 states and 1094 transitions. [2019-11-20 10:46:04,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:04,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-20 10:46:04,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:04,362 INFO L225 Difference]: With dead ends: 723 [2019-11-20 10:46:04,362 INFO L226 Difference]: Without dead ends: 425 [2019-11-20 10:46:04,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:04,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-11-20 10:46:04,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 356. [2019-11-20 10:46:04,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-20 10:46:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 545 transitions. [2019-11-20 10:46:04,373 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 545 transitions. Word has length 117 [2019-11-20 10:46:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:04,374 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 545 transitions. [2019-11-20 10:46:04,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:04,374 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 545 transitions. [2019-11-20 10:46:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 10:46:04,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:04,376 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:04,376 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:04,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:04,376 INFO L82 PathProgramCache]: Analyzing trace with hash 2088665573, now seen corresponding path program 1 times [2019-11-20 10:46:04,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:04,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475486265] [2019-11-20 10:46:04,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:04,439 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:46:04,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475486265] [2019-11-20 10:46:04,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:04,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:04,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68678702] [2019-11-20 10:46:04,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:04,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:04,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:04,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:04,442 INFO L87 Difference]: Start difference. First operand 356 states and 545 transitions. Second operand 4 states. [2019-11-20 10:46:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:04,892 INFO L93 Difference]: Finished difference Result 755 states and 1155 transitions. [2019-11-20 10:46:04,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:04,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-20 10:46:04,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:04,895 INFO L225 Difference]: With dead ends: 755 [2019-11-20 10:46:04,895 INFO L226 Difference]: Without dead ends: 418 [2019-11-20 10:46:04,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:04,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-20 10:46:04,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 355. [2019-11-20 10:46:04,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-11-20 10:46:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 544 transitions. [2019-11-20 10:46:04,908 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 544 transitions. Word has length 118 [2019-11-20 10:46:04,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:04,909 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 544 transitions. [2019-11-20 10:46:04,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 544 transitions. [2019-11-20 10:46:04,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 10:46:04,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:04,910 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:04,911 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:04,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:04,911 INFO L82 PathProgramCache]: Analyzing trace with hash -385280070, now seen corresponding path program 1 times [2019-11-20 10:46:04,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:04,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231649039] [2019-11-20 10:46:04,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:46:04,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231649039] [2019-11-20 10:46:04,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:04,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:04,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127335187] [2019-11-20 10:46:04,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:04,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:04,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:04,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:04,972 INFO L87 Difference]: Start difference. First operand 355 states and 544 transitions. Second operand 4 states. [2019-11-20 10:46:05,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:05,242 INFO L93 Difference]: Finished difference Result 718 states and 1101 transitions. [2019-11-20 10:46:05,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:05,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-20 10:46:05,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:05,245 INFO L225 Difference]: With dead ends: 718 [2019-11-20 10:46:05,245 INFO L226 Difference]: Without dead ends: 382 [2019-11-20 10:46:05,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:05,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-20 10:46:05,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 355. [2019-11-20 10:46:05,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-11-20 10:46:05,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 543 transitions. [2019-11-20 10:46:05,255 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 543 transitions. Word has length 118 [2019-11-20 10:46:05,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:05,255 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 543 transitions. [2019-11-20 10:46:05,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 543 transitions. [2019-11-20 10:46:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:46:05,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:05,257 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:05,257 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:05,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:05,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1006568817, now seen corresponding path program 1 times [2019-11-20 10:46:05,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:05,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414466958] [2019-11-20 10:46:05,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:05,322 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:46:05,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414466958] [2019-11-20 10:46:05,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:05,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:05,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921375566] [2019-11-20 10:46:05,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:05,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:05,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:05,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:05,324 INFO L87 Difference]: Start difference. First operand 355 states and 543 transitions. Second operand 4 states. [2019-11-20 10:46:05,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:05,638 INFO L93 Difference]: Finished difference Result 718 states and 1099 transitions. [2019-11-20 10:46:05,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:05,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-20 10:46:05,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:05,640 INFO L225 Difference]: With dead ends: 718 [2019-11-20 10:46:05,640 INFO L226 Difference]: Without dead ends: 382 [2019-11-20 10:46:05,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:05,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-20 10:46:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 355. [2019-11-20 10:46:05,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-11-20 10:46:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 542 transitions. [2019-11-20 10:46:05,647 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 542 transitions. Word has length 119 [2019-11-20 10:46:05,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:05,647 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 542 transitions. [2019-11-20 10:46:05,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:05,647 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 542 transitions. [2019-11-20 10:46:05,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 10:46:05,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:05,648 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:05,649 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:05,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:05,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1825993249, now seen corresponding path program 1 times [2019-11-20 10:46:05,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:05,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496756797] [2019-11-20 10:46:05,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:05,708 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:46:05,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496756797] [2019-11-20 10:46:05,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:05,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:05,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310864378] [2019-11-20 10:46:05,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:05,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:05,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:05,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:05,710 INFO L87 Difference]: Start difference. First operand 355 states and 542 transitions. Second operand 4 states. [2019-11-20 10:46:06,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:06,113 INFO L93 Difference]: Finished difference Result 718 states and 1097 transitions. [2019-11-20 10:46:06,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:06,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-20 10:46:06,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:06,116 INFO L225 Difference]: With dead ends: 718 [2019-11-20 10:46:06,116 INFO L226 Difference]: Without dead ends: 382 [2019-11-20 10:46:06,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:06,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-20 10:46:06,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 355. [2019-11-20 10:46:06,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-11-20 10:46:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 541 transitions. [2019-11-20 10:46:06,127 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 541 transitions. Word has length 120 [2019-11-20 10:46:06,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:06,128 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 541 transitions. [2019-11-20 10:46:06,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:06,128 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 541 transitions. [2019-11-20 10:46:06,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 10:46:06,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:06,129 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:06,130 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:06,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:06,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1823658614, now seen corresponding path program 1 times [2019-11-20 10:46:06,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:06,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901802259] [2019-11-20 10:46:06,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:06,187 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:46:06,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901802259] [2019-11-20 10:46:06,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:06,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:06,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386052755] [2019-11-20 10:46:06,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:06,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:06,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:06,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:06,189 INFO L87 Difference]: Start difference. First operand 355 states and 541 transitions. Second operand 4 states. [2019-11-20 10:46:06,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:06,480 INFO L93 Difference]: Finished difference Result 708 states and 1083 transitions. [2019-11-20 10:46:06,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:06,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-11-20 10:46:06,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:06,483 INFO L225 Difference]: With dead ends: 708 [2019-11-20 10:46:06,483 INFO L226 Difference]: Without dead ends: 372 [2019-11-20 10:46:06,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:06,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-20 10:46:06,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 355. [2019-11-20 10:46:06,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-11-20 10:46:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 540 transitions. [2019-11-20 10:46:06,494 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 540 transitions. Word has length 121 [2019-11-20 10:46:06,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:06,494 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 540 transitions. [2019-11-20 10:46:06,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 540 transitions. [2019-11-20 10:46:06,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:46:06,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:06,496 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] [2019-11-20 10:46:06,496 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:06,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:06,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1963622454, now seen corresponding path program 1 times [2019-11-20 10:46:06,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:06,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742461972] [2019-11-20 10:46:06,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:06,560 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:46:06,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742461972] [2019-11-20 10:46:06,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:06,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:46:06,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723245540] [2019-11-20 10:46:06,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:46:06,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:06,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:46:06,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:46:06,562 INFO L87 Difference]: Start difference. First operand 355 states and 540 transitions. Second operand 3 states. [2019-11-20 10:46:06,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:06,654 INFO L93 Difference]: Finished difference Result 1023 states and 1571 transitions. [2019-11-20 10:46:06,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:46:06,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-20 10:46:06,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:06,658 INFO L225 Difference]: With dead ends: 1023 [2019-11-20 10:46:06,658 INFO L226 Difference]: Without dead ends: 687 [2019-11-20 10:46:06,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:46:06,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-11-20 10:46:06,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 685. [2019-11-20 10:46:06,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-11-20 10:46:06,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1040 transitions. [2019-11-20 10:46:06,680 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1040 transitions. Word has length 122 [2019-11-20 10:46:06,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:06,680 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 1040 transitions. [2019-11-20 10:46:06,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:46:06,680 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1040 transitions. [2019-11-20 10:46:06,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 10:46:06,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:06,682 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-11-20 10:46:06,682 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:06,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:06,683 INFO L82 PathProgramCache]: Analyzing trace with hash -964530569, now seen corresponding path program 1 times [2019-11-20 10:46:06,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:06,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041486655] [2019-11-20 10:46:06,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:06,749 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:46:06,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041486655] [2019-11-20 10:46:06,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:06,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:06,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537617249] [2019-11-20 10:46:06,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:06,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:06,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:06,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:06,751 INFO L87 Difference]: Start difference. First operand 685 states and 1040 transitions. Second operand 4 states. [2019-11-20 10:46:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:07,274 INFO L93 Difference]: Finished difference Result 1563 states and 2382 transitions. [2019-11-20 10:46:07,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:07,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-11-20 10:46:07,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:07,279 INFO L225 Difference]: With dead ends: 1563 [2019-11-20 10:46:07,279 INFO L226 Difference]: Without dead ends: 897 [2019-11-20 10:46:07,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:07,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-11-20 10:46:07,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 763. [2019-11-20 10:46:07,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2019-11-20 10:46:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1182 transitions. [2019-11-20 10:46:07,306 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1182 transitions. Word has length 123 [2019-11-20 10:46:07,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:07,307 INFO L462 AbstractCegarLoop]: Abstraction has 763 states and 1182 transitions. [2019-11-20 10:46:07,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:07,307 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1182 transitions. [2019-11-20 10:46:07,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 10:46:07,309 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:07,309 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:07,309 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:07,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:07,310 INFO L82 PathProgramCache]: Analyzing trace with hash -76872869, now seen corresponding path program 1 times [2019-11-20 10:46:07,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:07,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881269387] [2019-11-20 10:46:07,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:46:07,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881269387] [2019-11-20 10:46:07,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:07,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:07,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961946646] [2019-11-20 10:46:07,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:07,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:07,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:07,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:07,394 INFO L87 Difference]: Start difference. First operand 763 states and 1182 transitions. Second operand 4 states. [2019-11-20 10:46:07,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:07,953 INFO L93 Difference]: Finished difference Result 1631 states and 2510 transitions. [2019-11-20 10:46:07,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:07,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-11-20 10:46:07,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:07,958 INFO L225 Difference]: With dead ends: 1631 [2019-11-20 10:46:07,958 INFO L226 Difference]: Without dead ends: 887 [2019-11-20 10:46:07,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:07,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2019-11-20 10:46:07,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 685. [2019-11-20 10:46:07,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-11-20 10:46:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1040 transitions. [2019-11-20 10:46:07,982 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1040 transitions. Word has length 124 [2019-11-20 10:46:07,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:07,982 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 1040 transitions. [2019-11-20 10:46:07,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:07,983 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1040 transitions. [2019-11-20 10:46:07,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-20 10:46:07,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:07,984 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, 1, 1] [2019-11-20 10:46:07,984 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:07,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:07,985 INFO L82 PathProgramCache]: Analyzing trace with hash -357296708, now seen corresponding path program 1 times [2019-11-20 10:46:07,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:07,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200192802] [2019-11-20 10:46:07,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:46:08,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200192802] [2019-11-20 10:46:08,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:08,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:08,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789672754] [2019-11-20 10:46:08,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:08,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:08,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:08,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:08,057 INFO L87 Difference]: Start difference. First operand 685 states and 1040 transitions. Second operand 4 states. [2019-11-20 10:46:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:08,476 INFO L93 Difference]: Finished difference Result 1383 states and 2102 transitions. [2019-11-20 10:46:08,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:08,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-11-20 10:46:08,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:08,481 INFO L225 Difference]: With dead ends: 1383 [2019-11-20 10:46:08,481 INFO L226 Difference]: Without dead ends: 717 [2019-11-20 10:46:08,482 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:08,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-11-20 10:46:08,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 691. [2019-11-20 10:46:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-11-20 10:46:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1046 transitions. [2019-11-20 10:46:08,503 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1046 transitions. Word has length 125 [2019-11-20 10:46:08,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:08,504 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 1046 transitions. [2019-11-20 10:46:08,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:08,504 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1046 transitions. [2019-11-20 10:46:08,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-20 10:46:08,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:08,506 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:08,506 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:08,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:08,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1978467926, now seen corresponding path program 1 times [2019-11-20 10:46:08,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:08,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321090951] [2019-11-20 10:46:08,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:08,573 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 10:46:08,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321090951] [2019-11-20 10:46:08,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:08,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:08,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856970875] [2019-11-20 10:46:08,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:08,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:08,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:08,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:08,577 INFO L87 Difference]: Start difference. First operand 691 states and 1046 transitions. Second operand 4 states. [2019-11-20 10:46:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:09,003 INFO L93 Difference]: Finished difference Result 1397 states and 2116 transitions. [2019-11-20 10:46:09,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:09,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-11-20 10:46:09,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:09,009 INFO L225 Difference]: With dead ends: 1397 [2019-11-20 10:46:09,009 INFO L226 Difference]: Without dead ends: 725 [2019-11-20 10:46:09,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:09,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2019-11-20 10:46:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 691. [2019-11-20 10:46:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-11-20 10:46:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1044 transitions. [2019-11-20 10:46:09,025 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1044 transitions. Word has length 131 [2019-11-20 10:46:09,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:09,026 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 1044 transitions. [2019-11-20 10:46:09,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1044 transitions. [2019-11-20 10:46:09,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-20 10:46:09,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:09,028 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:09,028 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:09,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:09,028 INFO L82 PathProgramCache]: Analyzing trace with hash -490852613, now seen corresponding path program 1 times [2019-11-20 10:46:09,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:09,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692652057] [2019-11-20 10:46:09,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 10:46:09,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692652057] [2019-11-20 10:46:09,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:09,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:09,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522841292] [2019-11-20 10:46:09,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:09,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:09,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:09,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:09,094 INFO L87 Difference]: Start difference. First operand 691 states and 1044 transitions. Second operand 4 states. [2019-11-20 10:46:09,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:09,392 INFO L93 Difference]: Finished difference Result 1489 states and 2262 transitions. [2019-11-20 10:46:09,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:09,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-11-20 10:46:09,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:09,395 INFO L225 Difference]: With dead ends: 1489 [2019-11-20 10:46:09,395 INFO L226 Difference]: Without dead ends: 817 [2019-11-20 10:46:09,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:09,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2019-11-20 10:46:09,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 747. [2019-11-20 10:46:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-11-20 10:46:09,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1142 transitions. [2019-11-20 10:46:09,414 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1142 transitions. Word has length 131 [2019-11-20 10:46:09,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:09,414 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1142 transitions. [2019-11-20 10:46:09,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1142 transitions. [2019-11-20 10:46:09,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 10:46:09,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:09,416 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:09,417 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:09,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:09,417 INFO L82 PathProgramCache]: Analyzing trace with hash -127035201, now seen corresponding path program 1 times [2019-11-20 10:46:09,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:09,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247257490] [2019-11-20 10:46:09,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:09,483 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 10:46:09,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247257490] [2019-11-20 10:46:09,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:09,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:09,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562156529] [2019-11-20 10:46:09,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:09,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:09,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:09,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:09,485 INFO L87 Difference]: Start difference. First operand 747 states and 1142 transitions. Second operand 4 states. [2019-11-20 10:46:09,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:09,760 INFO L93 Difference]: Finished difference Result 1505 states and 2304 transitions. [2019-11-20 10:46:09,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:09,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-11-20 10:46:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:09,763 INFO L225 Difference]: With dead ends: 1505 [2019-11-20 10:46:09,763 INFO L226 Difference]: Without dead ends: 777 [2019-11-20 10:46:09,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:09,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2019-11-20 10:46:09,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 747. [2019-11-20 10:46:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-11-20 10:46:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1140 transitions. [2019-11-20 10:46:09,778 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1140 transitions. Word has length 132 [2019-11-20 10:46:09,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:09,778 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1140 transitions. [2019-11-20 10:46:09,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1140 transitions. [2019-11-20 10:46:09,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 10:46:09,780 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:09,780 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:09,780 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:09,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:09,780 INFO L82 PathProgramCache]: Analyzing trace with hash -719151105, now seen corresponding path program 1 times [2019-11-20 10:46:09,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:09,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404827938] [2019-11-20 10:46:09,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:46:09,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404827938] [2019-11-20 10:46:09,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:09,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:09,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389479149] [2019-11-20 10:46:09,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:09,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:09,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:09,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:09,843 INFO L87 Difference]: Start difference. First operand 747 states and 1140 transitions. Second operand 4 states. [2019-11-20 10:46:10,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:10,180 INFO L93 Difference]: Finished difference Result 1677 states and 2566 transitions. [2019-11-20 10:46:10,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:10,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-11-20 10:46:10,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:10,184 INFO L225 Difference]: With dead ends: 1677 [2019-11-20 10:46:10,185 INFO L226 Difference]: Without dead ends: 949 [2019-11-20 10:46:10,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:10,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-11-20 10:46:10,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 771. [2019-11-20 10:46:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-11-20 10:46:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1174 transitions. [2019-11-20 10:46:10,204 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1174 transitions. Word has length 132 [2019-11-20 10:46:10,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:10,204 INFO L462 AbstractCegarLoop]: Abstraction has 771 states and 1174 transitions. [2019-11-20 10:46:10,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1174 transitions. [2019-11-20 10:46:10,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-20 10:46:10,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:10,206 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:10,207 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:10,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:10,207 INFO L82 PathProgramCache]: Analyzing trace with hash -753498676, now seen corresponding path program 1 times [2019-11-20 10:46:10,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:10,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708090430] [2019-11-20 10:46:10,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:10,270 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:46:10,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708090430] [2019-11-20 10:46:10,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:10,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:10,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976518263] [2019-11-20 10:46:10,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:10,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:10,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:10,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:10,272 INFO L87 Difference]: Start difference. First operand 771 states and 1174 transitions. Second operand 4 states. [2019-11-20 10:46:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:10,610 INFO L93 Difference]: Finished difference Result 1701 states and 2598 transitions. [2019-11-20 10:46:10,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:10,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-11-20 10:46:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:10,614 INFO L225 Difference]: With dead ends: 1701 [2019-11-20 10:46:10,614 INFO L226 Difference]: Without dead ends: 949 [2019-11-20 10:46:10,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:10,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-11-20 10:46:10,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 773. [2019-11-20 10:46:10,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-11-20 10:46:10,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1176 transitions. [2019-11-20 10:46:10,638 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1176 transitions. Word has length 133 [2019-11-20 10:46:10,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:10,638 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1176 transitions. [2019-11-20 10:46:10,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:10,639 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1176 transitions. [2019-11-20 10:46:10,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-20 10:46:10,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:10,640 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:10,641 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:10,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:10,641 INFO L82 PathProgramCache]: Analyzing trace with hash -553510684, now seen corresponding path program 1 times [2019-11-20 10:46:10,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:10,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528154097] [2019-11-20 10:46:10,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:46:10,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528154097] [2019-11-20 10:46:10,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:10,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:10,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929357303] [2019-11-20 10:46:10,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:10,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:10,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:10,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:10,711 INFO L87 Difference]: Start difference. First operand 773 states and 1176 transitions. Second operand 4 states. [2019-11-20 10:46:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:11,048 INFO L93 Difference]: Finished difference Result 1703 states and 2598 transitions. [2019-11-20 10:46:11,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:11,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-20 10:46:11,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:11,053 INFO L225 Difference]: With dead ends: 1703 [2019-11-20 10:46:11,053 INFO L226 Difference]: Without dead ends: 949 [2019-11-20 10:46:11,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:11,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-11-20 10:46:11,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 775. [2019-11-20 10:46:11,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-11-20 10:46:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1178 transitions. [2019-11-20 10:46:11,075 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1178 transitions. Word has length 134 [2019-11-20 10:46:11,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:11,076 INFO L462 AbstractCegarLoop]: Abstraction has 775 states and 1178 transitions. [2019-11-20 10:46:11,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:11,076 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1178 transitions. [2019-11-20 10:46:11,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-20 10:46:11,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:11,077 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:11,077 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:11,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:11,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1679054831, now seen corresponding path program 1 times [2019-11-20 10:46:11,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:11,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12703057] [2019-11-20 10:46:11,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:11,138 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:46:11,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12703057] [2019-11-20 10:46:11,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:11,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:11,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417962426] [2019-11-20 10:46:11,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:11,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:11,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:11,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:11,140 INFO L87 Difference]: Start difference. First operand 775 states and 1178 transitions. Second operand 4 states. [2019-11-20 10:46:11,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:11,477 INFO L93 Difference]: Finished difference Result 1685 states and 2574 transitions. [2019-11-20 10:46:11,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:11,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-11-20 10:46:11,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:11,482 INFO L225 Difference]: With dead ends: 1685 [2019-11-20 10:46:11,483 INFO L226 Difference]: Without dead ends: 929 [2019-11-20 10:46:11,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:11,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-11-20 10:46:11,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 777. [2019-11-20 10:46:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-11-20 10:46:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1180 transitions. [2019-11-20 10:46:11,532 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1180 transitions. Word has length 135 [2019-11-20 10:46:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:11,532 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1180 transitions. [2019-11-20 10:46:11,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:11,532 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1180 transitions. [2019-11-20 10:46:11,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-20 10:46:11,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:11,533 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:11,533 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:11,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:11,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1027843339, now seen corresponding path program 1 times [2019-11-20 10:46:11,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:11,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538237918] [2019-11-20 10:46:11,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:11,595 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:46:11,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538237918] [2019-11-20 10:46:11,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:11,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:11,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657829679] [2019-11-20 10:46:11,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:11,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:11,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:11,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:11,597 INFO L87 Difference]: Start difference. First operand 777 states and 1180 transitions. Second operand 4 states. [2019-11-20 10:46:11,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:11,965 INFO L93 Difference]: Finished difference Result 1707 states and 2598 transitions. [2019-11-20 10:46:11,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:11,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-11-20 10:46:11,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:11,970 INFO L225 Difference]: With dead ends: 1707 [2019-11-20 10:46:11,970 INFO L226 Difference]: Without dead ends: 949 [2019-11-20 10:46:11,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:11,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-11-20 10:46:11,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 777. [2019-11-20 10:46:11,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-11-20 10:46:11,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1178 transitions. [2019-11-20 10:46:11,992 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1178 transitions. Word has length 138 [2019-11-20 10:46:11,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:11,992 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1178 transitions. [2019-11-20 10:46:11,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:11,992 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1178 transitions. [2019-11-20 10:46:11,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-20 10:46:11,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:11,994 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:11,995 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:11,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:11,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1733023338, now seen corresponding path program 1 times [2019-11-20 10:46:11,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:11,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602468252] [2019-11-20 10:46:11,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:46:12,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602468252] [2019-11-20 10:46:12,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:12,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:12,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962936821] [2019-11-20 10:46:12,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:12,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:12,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:12,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:12,060 INFO L87 Difference]: Start difference. First operand 777 states and 1178 transitions. Second operand 4 states. [2019-11-20 10:46:12,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:12,411 INFO L93 Difference]: Finished difference Result 1707 states and 2594 transitions. [2019-11-20 10:46:12,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:12,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-11-20 10:46:12,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:12,413 INFO L225 Difference]: With dead ends: 1707 [2019-11-20 10:46:12,413 INFO L226 Difference]: Without dead ends: 949 [2019-11-20 10:46:12,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:12,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-11-20 10:46:12,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 777. [2019-11-20 10:46:12,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-11-20 10:46:12,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1176 transitions. [2019-11-20 10:46:12,433 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1176 transitions. Word has length 139 [2019-11-20 10:46:12,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:12,433 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1176 transitions. [2019-11-20 10:46:12,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:12,434 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1176 transitions. [2019-11-20 10:46:12,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-20 10:46:12,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:12,435 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:12,435 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:12,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:12,435 INFO L82 PathProgramCache]: Analyzing trace with hash -854004134, now seen corresponding path program 1 times [2019-11-20 10:46:12,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:12,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272172432] [2019-11-20 10:46:12,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:46:12,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272172432] [2019-11-20 10:46:12,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:12,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:12,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943679607] [2019-11-20 10:46:12,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:12,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:12,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:12,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:12,502 INFO L87 Difference]: Start difference. First operand 777 states and 1176 transitions. Second operand 4 states. [2019-11-20 10:46:12,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:12,905 INFO L93 Difference]: Finished difference Result 1707 states and 2590 transitions. [2019-11-20 10:46:12,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:12,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-11-20 10:46:12,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:12,907 INFO L225 Difference]: With dead ends: 1707 [2019-11-20 10:46:12,907 INFO L226 Difference]: Without dead ends: 949 [2019-11-20 10:46:12,908 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:12,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-11-20 10:46:12,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 777. [2019-11-20 10:46:12,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-11-20 10:46:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1174 transitions. [2019-11-20 10:46:12,925 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1174 transitions. Word has length 140 [2019-11-20 10:46:12,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:12,925 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1174 transitions. [2019-11-20 10:46:12,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:12,925 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1174 transitions. [2019-11-20 10:46:12,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-20 10:46:12,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:12,927 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:12,927 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:12,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:12,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1890550107, now seen corresponding path program 1 times [2019-11-20 10:46:12,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:12,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894168158] [2019-11-20 10:46:12,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:46:12,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894168158] [2019-11-20 10:46:12,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:12,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:12,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120181587] [2019-11-20 10:46:12,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:12,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:12,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:12,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:12,992 INFO L87 Difference]: Start difference. First operand 777 states and 1174 transitions. Second operand 4 states. [2019-11-20 10:46:13,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:13,412 INFO L93 Difference]: Finished difference Result 1687 states and 2562 transitions. [2019-11-20 10:46:13,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:13,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-11-20 10:46:13,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:13,414 INFO L225 Difference]: With dead ends: 1687 [2019-11-20 10:46:13,414 INFO L226 Difference]: Without dead ends: 929 [2019-11-20 10:46:13,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:13,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-11-20 10:46:13,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 747. [2019-11-20 10:46:13,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-11-20 10:46:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1132 transitions. [2019-11-20 10:46:13,433 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1132 transitions. Word has length 141 [2019-11-20 10:46:13,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:13,433 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1132 transitions. [2019-11-20 10:46:13,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:13,433 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1132 transitions. [2019-11-20 10:46:13,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-20 10:46:13,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:13,435 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:13,435 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:13,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:13,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1419647362, now seen corresponding path program 1 times [2019-11-20 10:46:13,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:13,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302083693] [2019-11-20 10:46:13,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:13,497 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:46:13,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302083693] [2019-11-20 10:46:13,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:13,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:13,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565035907] [2019-11-20 10:46:13,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:13,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:13,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:13,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:13,499 INFO L87 Difference]: Start difference. First operand 747 states and 1132 transitions. Second operand 4 states. [2019-11-20 10:46:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:13,834 INFO L93 Difference]: Finished difference Result 1657 states and 2518 transitions. [2019-11-20 10:46:13,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:13,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-11-20 10:46:13,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:13,836 INFO L225 Difference]: With dead ends: 1657 [2019-11-20 10:46:13,836 INFO L226 Difference]: Without dead ends: 929 [2019-11-20 10:46:13,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:13,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-11-20 10:46:13,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 803. [2019-11-20 10:46:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-11-20 10:46:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1222 transitions. [2019-11-20 10:46:13,857 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1222 transitions. Word has length 142 [2019-11-20 10:46:13,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:13,857 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1222 transitions. [2019-11-20 10:46:13,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:13,857 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1222 transitions. [2019-11-20 10:46:13,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 10:46:13,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:13,859 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:13,859 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:13,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:13,859 INFO L82 PathProgramCache]: Analyzing trace with hash 684152075, now seen corresponding path program 1 times [2019-11-20 10:46:13,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:13,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295128850] [2019-11-20 10:46:13,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:46:13,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295128850] [2019-11-20 10:46:13,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:13,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:13,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782459099] [2019-11-20 10:46:13,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:13,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:13,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:13,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:13,930 INFO L87 Difference]: Start difference. First operand 803 states and 1222 transitions. Second operand 4 states. [2019-11-20 10:46:14,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:14,268 INFO L93 Difference]: Finished difference Result 1697 states and 2580 transitions. [2019-11-20 10:46:14,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:14,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-20 10:46:14,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:14,270 INFO L225 Difference]: With dead ends: 1697 [2019-11-20 10:46:14,270 INFO L226 Difference]: Without dead ends: 913 [2019-11-20 10:46:14,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-11-20 10:46:14,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 805. [2019-11-20 10:46:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-11-20 10:46:14,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1224 transitions. [2019-11-20 10:46:14,297 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1224 transitions. Word has length 143 [2019-11-20 10:46:14,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:14,297 INFO L462 AbstractCegarLoop]: Abstraction has 805 states and 1224 transitions. [2019-11-20 10:46:14,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:14,297 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1224 transitions. [2019-11-20 10:46:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-20 10:46:14,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:14,299 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:14,299 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:14,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:14,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1851250225, now seen corresponding path program 1 times [2019-11-20 10:46:14,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:14,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015280954] [2019-11-20 10:46:14,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:14,407 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-20 10:46:14,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015280954] [2019-11-20 10:46:14,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:14,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:14,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113798690] [2019-11-20 10:46:14,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:14,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:14,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:14,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:14,409 INFO L87 Difference]: Start difference. First operand 805 states and 1224 transitions. Second operand 4 states. [2019-11-20 10:46:14,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:14,745 INFO L93 Difference]: Finished difference Result 1699 states and 2580 transitions. [2019-11-20 10:46:14,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:14,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-20 10:46:14,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:14,747 INFO L225 Difference]: With dead ends: 1699 [2019-11-20 10:46:14,747 INFO L226 Difference]: Without dead ends: 913 [2019-11-20 10:46:14,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:14,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-11-20 10:46:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 805. [2019-11-20 10:46:14,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-11-20 10:46:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1222 transitions. [2019-11-20 10:46:14,774 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1222 transitions. Word has length 145 [2019-11-20 10:46:14,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:14,774 INFO L462 AbstractCegarLoop]: Abstraction has 805 states and 1222 transitions. [2019-11-20 10:46:14,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:14,774 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1222 transitions. [2019-11-20 10:46:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 10:46:14,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:14,775 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:14,775 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:14,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:14,776 INFO L82 PathProgramCache]: Analyzing trace with hash 224183364, now seen corresponding path program 1 times [2019-11-20 10:46:14,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:14,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430074567] [2019-11-20 10:46:14,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:14,842 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-20 10:46:14,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430074567] [2019-11-20 10:46:14,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:14,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:14,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100776096] [2019-11-20 10:46:14,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:14,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:14,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:14,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:14,844 INFO L87 Difference]: Start difference. First operand 805 states and 1222 transitions. Second operand 4 states. [2019-11-20 10:46:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:15,210 INFO L93 Difference]: Finished difference Result 1695 states and 2572 transitions. [2019-11-20 10:46:15,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:15,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-11-20 10:46:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:15,212 INFO L225 Difference]: With dead ends: 1695 [2019-11-20 10:46:15,212 INFO L226 Difference]: Without dead ends: 909 [2019-11-20 10:46:15,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:15,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-20 10:46:15,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 805. [2019-11-20 10:46:15,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-11-20 10:46:15,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1220 transitions. [2019-11-20 10:46:15,243 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1220 transitions. Word has length 146 [2019-11-20 10:46:15,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:15,243 INFO L462 AbstractCegarLoop]: Abstraction has 805 states and 1220 transitions. [2019-11-20 10:46:15,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:15,243 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1220 transitions. [2019-11-20 10:46:15,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 10:46:15,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:15,245 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:15,245 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:15,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:15,246 INFO L82 PathProgramCache]: Analyzing trace with hash -781971136, now seen corresponding path program 1 times [2019-11-20 10:46:15,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:15,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043159574] [2019-11-20 10:46:15,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:46:15,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043159574] [2019-11-20 10:46:15,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:15,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:15,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841598749] [2019-11-20 10:46:15,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:15,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:15,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:15,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:15,316 INFO L87 Difference]: Start difference. First operand 805 states and 1220 transitions. Second operand 4 states. [2019-11-20 10:46:15,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:15,736 INFO L93 Difference]: Finished difference Result 1689 states and 2560 transitions. [2019-11-20 10:46:15,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:15,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-11-20 10:46:15,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:15,738 INFO L225 Difference]: With dead ends: 1689 [2019-11-20 10:46:15,738 INFO L226 Difference]: Without dead ends: 903 [2019-11-20 10:46:15,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:15,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-11-20 10:46:15,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 811. [2019-11-20 10:46:15,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-11-20 10:46:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1230 transitions. [2019-11-20 10:46:15,759 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1230 transitions. Word has length 146 [2019-11-20 10:46:15,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:15,759 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1230 transitions. [2019-11-20 10:46:15,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1230 transitions. [2019-11-20 10:46:15,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 10:46:15,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:15,761 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:15,761 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:15,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:15,761 INFO L82 PathProgramCache]: Analyzing trace with hash -21036559, now seen corresponding path program 1 times [2019-11-20 10:46:15,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:15,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545011117] [2019-11-20 10:46:15,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 10:46:15,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545011117] [2019-11-20 10:46:15,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:15,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:15,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977235234] [2019-11-20 10:46:15,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:15,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:15,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:15,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:15,831 INFO L87 Difference]: Start difference. First operand 811 states and 1230 transitions. Second operand 4 states. [2019-11-20 10:46:16,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:16,146 INFO L93 Difference]: Finished difference Result 1673 states and 2534 transitions. [2019-11-20 10:46:16,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:16,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-11-20 10:46:16,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:16,149 INFO L225 Difference]: With dead ends: 1673 [2019-11-20 10:46:16,149 INFO L226 Difference]: Without dead ends: 881 [2019-11-20 10:46:16,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-11-20 10:46:16,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 811. [2019-11-20 10:46:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-11-20 10:46:16,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1228 transitions. [2019-11-20 10:46:16,170 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1228 transitions. Word has length 146 [2019-11-20 10:46:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:16,170 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1228 transitions. [2019-11-20 10:46:16,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:16,170 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1228 transitions. [2019-11-20 10:46:16,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-20 10:46:16,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:16,171 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:16,171 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:16,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:16,172 INFO L82 PathProgramCache]: Analyzing trace with hash -586784230, now seen corresponding path program 1 times [2019-11-20 10:46:16,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:16,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554300668] [2019-11-20 10:46:16,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:16,236 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 10:46:16,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554300668] [2019-11-20 10:46:16,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:16,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:16,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650236745] [2019-11-20 10:46:16,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:16,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:16,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:16,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:16,239 INFO L87 Difference]: Start difference. First operand 811 states and 1228 transitions. Second operand 4 states. [2019-11-20 10:46:16,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:16,580 INFO L93 Difference]: Finished difference Result 1673 states and 2530 transitions. [2019-11-20 10:46:16,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:16,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-20 10:46:16,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:16,582 INFO L225 Difference]: With dead ends: 1673 [2019-11-20 10:46:16,582 INFO L226 Difference]: Without dead ends: 881 [2019-11-20 10:46:16,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:16,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-11-20 10:46:16,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 811. [2019-11-20 10:46:16,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-11-20 10:46:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1226 transitions. [2019-11-20 10:46:16,612 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1226 transitions. Word has length 147 [2019-11-20 10:46:16,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:16,612 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1226 transitions. [2019-11-20 10:46:16,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:16,613 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1226 transitions. [2019-11-20 10:46:16,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 10:46:16,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:16,615 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:16,615 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:16,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:16,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1801381364, now seen corresponding path program 1 times [2019-11-20 10:46:16,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:16,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721805960] [2019-11-20 10:46:16,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:16,687 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:46:16,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721805960] [2019-11-20 10:46:16,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:16,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:16,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796270511] [2019-11-20 10:46:16,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:16,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:16,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:16,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:16,689 INFO L87 Difference]: Start difference. First operand 811 states and 1226 transitions. Second operand 4 states. [2019-11-20 10:46:17,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:17,156 INFO L93 Difference]: Finished difference Result 1721 states and 2598 transitions. [2019-11-20 10:46:17,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:17,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-20 10:46:17,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:17,158 INFO L225 Difference]: With dead ends: 1721 [2019-11-20 10:46:17,158 INFO L226 Difference]: Without dead ends: 929 [2019-11-20 10:46:17,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:17,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-11-20 10:46:17,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 811. [2019-11-20 10:46:17,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-11-20 10:46:17,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1224 transitions. [2019-11-20 10:46:17,184 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1224 transitions. Word has length 148 [2019-11-20 10:46:17,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:17,185 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1224 transitions. [2019-11-20 10:46:17,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:17,185 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1224 transitions. [2019-11-20 10:46:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 10:46:17,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:17,187 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:17,187 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:17,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:17,188 INFO L82 PathProgramCache]: Analyzing trace with hash 319669846, now seen corresponding path program 1 times [2019-11-20 10:46:17,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:17,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527741311] [2019-11-20 10:46:17,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 10:46:17,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527741311] [2019-11-20 10:46:17,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:17,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:17,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090626912] [2019-11-20 10:46:17,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:17,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:17,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:17,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:17,259 INFO L87 Difference]: Start difference. First operand 811 states and 1224 transitions. Second operand 4 states. [2019-11-20 10:46:17,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:17,750 INFO L93 Difference]: Finished difference Result 1673 states and 2522 transitions. [2019-11-20 10:46:17,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:17,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-20 10:46:17,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:17,752 INFO L225 Difference]: With dead ends: 1673 [2019-11-20 10:46:17,752 INFO L226 Difference]: Without dead ends: 881 [2019-11-20 10:46:17,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:17,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-11-20 10:46:17,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 811. [2019-11-20 10:46:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-11-20 10:46:17,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1222 transitions. [2019-11-20 10:46:17,786 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1222 transitions. Word has length 148 [2019-11-20 10:46:17,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:17,787 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1222 transitions. [2019-11-20 10:46:17,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:17,787 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1222 transitions. [2019-11-20 10:46:17,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 10:46:17,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:17,789 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:17,789 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:17,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:17,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1751794773, now seen corresponding path program 1 times [2019-11-20 10:46:17,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:17,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775353404] [2019-11-20 10:46:17,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:46:17,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775353404] [2019-11-20 10:46:17,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:17,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:17,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135158895] [2019-11-20 10:46:17,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:17,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:17,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:17,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:17,865 INFO L87 Difference]: Start difference. First operand 811 states and 1222 transitions. Second operand 4 states. [2019-11-20 10:46:18,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:18,307 INFO L93 Difference]: Finished difference Result 1705 states and 2564 transitions. [2019-11-20 10:46:18,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:18,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-20 10:46:18,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:18,309 INFO L225 Difference]: With dead ends: 1705 [2019-11-20 10:46:18,309 INFO L226 Difference]: Without dead ends: 913 [2019-11-20 10:46:18,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:18,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-11-20 10:46:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 811. [2019-11-20 10:46:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-11-20 10:46:18,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1220 transitions. [2019-11-20 10:46:18,334 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1220 transitions. Word has length 149 [2019-11-20 10:46:18,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:18,334 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1220 transitions. [2019-11-20 10:46:18,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:18,334 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1220 transitions. [2019-11-20 10:46:18,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 10:46:18,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:18,335 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:18,336 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:18,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:18,336 INFO L82 PathProgramCache]: Analyzing trace with hash -740877549, now seen corresponding path program 1 times [2019-11-20 10:46:18,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:18,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365443101] [2019-11-20 10:46:18,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:46:18,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365443101] [2019-11-20 10:46:18,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:18,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:18,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392994377] [2019-11-20 10:46:18,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:18,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:18,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:18,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:18,407 INFO L87 Difference]: Start difference. First operand 811 states and 1220 transitions. Second operand 4 states. [2019-11-20 10:46:18,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:18,917 INFO L93 Difference]: Finished difference Result 1695 states and 2548 transitions. [2019-11-20 10:46:18,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:18,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-20 10:46:18,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:18,919 INFO L225 Difference]: With dead ends: 1695 [2019-11-20 10:46:18,919 INFO L226 Difference]: Without dead ends: 903 [2019-11-20 10:46:18,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:18,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-11-20 10:46:18,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 813. [2019-11-20 10:46:18,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-20 10:46:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1222 transitions. [2019-11-20 10:46:18,954 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1222 transitions. Word has length 149 [2019-11-20 10:46:18,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:18,954 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1222 transitions. [2019-11-20 10:46:18,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:18,955 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1222 transitions. [2019-11-20 10:46:18,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 10:46:18,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:18,957 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:18,960 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:18,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:18,960 INFO L82 PathProgramCache]: Analyzing trace with hash -380262177, now seen corresponding path program 1 times [2019-11-20 10:46:18,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:18,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281607336] [2019-11-20 10:46:18,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:19,049 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 10:46:19,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281607336] [2019-11-20 10:46:19,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:19,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:19,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446204763] [2019-11-20 10:46:19,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:19,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:19,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:19,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:19,051 INFO L87 Difference]: Start difference. First operand 813 states and 1222 transitions. Second operand 4 states. [2019-11-20 10:46:19,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:19,382 INFO L93 Difference]: Finished difference Result 1657 states and 2494 transitions. [2019-11-20 10:46:19,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:19,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-20 10:46:19,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:19,385 INFO L225 Difference]: With dead ends: 1657 [2019-11-20 10:46:19,385 INFO L226 Difference]: Without dead ends: 863 [2019-11-20 10:46:19,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:19,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-11-20 10:46:19,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 813. [2019-11-20 10:46:19,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-20 10:46:19,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1220 transitions. [2019-11-20 10:46:19,420 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1220 transitions. Word has length 149 [2019-11-20 10:46:19,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:19,421 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1220 transitions. [2019-11-20 10:46:19,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:19,421 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1220 transitions. [2019-11-20 10:46:19,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-20 10:46:19,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:19,423 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:19,423 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:19,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:19,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1679741845, now seen corresponding path program 1 times [2019-11-20 10:46:19,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:19,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690677849] [2019-11-20 10:46:19,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:46:19,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690677849] [2019-11-20 10:46:19,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:19,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:19,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765769026] [2019-11-20 10:46:19,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:19,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:19,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:19,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:19,499 INFO L87 Difference]: Start difference. First operand 813 states and 1220 transitions. Second operand 4 states. [2019-11-20 10:46:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:19,926 INFO L93 Difference]: Finished difference Result 1685 states and 2528 transitions. [2019-11-20 10:46:19,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:19,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-20 10:46:19,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:19,928 INFO L225 Difference]: With dead ends: 1685 [2019-11-20 10:46:19,928 INFO L226 Difference]: Without dead ends: 891 [2019-11-20 10:46:19,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:19,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2019-11-20 10:46:19,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 815. [2019-11-20 10:46:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-11-20 10:46:19,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1222 transitions. [2019-11-20 10:46:19,961 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1222 transitions. Word has length 150 [2019-11-20 10:46:19,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:19,961 INFO L462 AbstractCegarLoop]: Abstraction has 815 states and 1222 transitions. [2019-11-20 10:46:19,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:19,962 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1222 transitions. [2019-11-20 10:46:19,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-20 10:46:19,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:19,963 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:19,963 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:19,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:19,963 INFO L82 PathProgramCache]: Analyzing trace with hash 276844141, now seen corresponding path program 1 times [2019-11-20 10:46:19,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:19,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231201336] [2019-11-20 10:46:19,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:46:20,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231201336] [2019-11-20 10:46:20,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:20,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:20,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503444079] [2019-11-20 10:46:20,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:20,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:20,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:20,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:20,017 INFO L87 Difference]: Start difference. First operand 815 states and 1222 transitions. Second operand 4 states. [2019-11-20 10:46:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:20,333 INFO L93 Difference]: Finished difference Result 1687 states and 2528 transitions. [2019-11-20 10:46:20,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:20,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-20 10:46:20,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:20,334 INFO L225 Difference]: With dead ends: 1687 [2019-11-20 10:46:20,334 INFO L226 Difference]: Without dead ends: 891 [2019-11-20 10:46:20,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2019-11-20 10:46:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 817. [2019-11-20 10:46:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-11-20 10:46:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1224 transitions. [2019-11-20 10:46:20,358 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1224 transitions. Word has length 150 [2019-11-20 10:46:20,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:20,358 INFO L462 AbstractCegarLoop]: Abstraction has 817 states and 1224 transitions. [2019-11-20 10:46:20,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:20,358 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1224 transitions. [2019-11-20 10:46:20,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 10:46:20,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:20,360 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:20,360 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:20,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:20,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1358699259, now seen corresponding path program 1 times [2019-11-20 10:46:20,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:20,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229598393] [2019-11-20 10:46:20,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 10:46:20,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229598393] [2019-11-20 10:46:20,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:20,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:20,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098023775] [2019-11-20 10:46:20,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:20,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:20,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:20,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:20,422 INFO L87 Difference]: Start difference. First operand 817 states and 1224 transitions. Second operand 4 states. [2019-11-20 10:46:20,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:20,827 INFO L93 Difference]: Finished difference Result 1711 states and 2556 transitions. [2019-11-20 10:46:20,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:20,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-20 10:46:20,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:20,829 INFO L225 Difference]: With dead ends: 1711 [2019-11-20 10:46:20,829 INFO L226 Difference]: Without dead ends: 913 [2019-11-20 10:46:20,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:20,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-11-20 10:46:20,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 817. [2019-11-20 10:46:20,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-11-20 10:46:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1222 transitions. [2019-11-20 10:46:20,882 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1222 transitions. Word has length 151 [2019-11-20 10:46:20,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:20,883 INFO L462 AbstractCegarLoop]: Abstraction has 817 states and 1222 transitions. [2019-11-20 10:46:20,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:20,883 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1222 transitions. [2019-11-20 10:46:20,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 10:46:20,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:20,886 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:20,886 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:20,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:20,887 INFO L82 PathProgramCache]: Analyzing trace with hash -386294923, now seen corresponding path program 1 times [2019-11-20 10:46:20,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:20,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227410162] [2019-11-20 10:46:20,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:46:21,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227410162] [2019-11-20 10:46:21,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:21,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:21,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007331119] [2019-11-20 10:46:21,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:21,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:21,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:21,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:21,064 INFO L87 Difference]: Start difference. First operand 817 states and 1222 transitions. Second operand 4 states. [2019-11-20 10:46:21,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:21,518 INFO L93 Difference]: Finished difference Result 1683 states and 2517 transitions. [2019-11-20 10:46:21,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:21,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-20 10:46:21,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:21,519 INFO L225 Difference]: With dead ends: 1683 [2019-11-20 10:46:21,519 INFO L226 Difference]: Without dead ends: 885 [2019-11-20 10:46:21,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:21,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2019-11-20 10:46:21,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 819. [2019-11-20 10:46:21,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-11-20 10:46:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1224 transitions. [2019-11-20 10:46:21,554 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1224 transitions. Word has length 151 [2019-11-20 10:46:21,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:21,554 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 1224 transitions. [2019-11-20 10:46:21,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:21,554 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1224 transitions. [2019-11-20 10:46:21,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-20 10:46:21,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:21,556 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:21,557 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:21,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:21,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2134972602, now seen corresponding path program 1 times [2019-11-20 10:46:21,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:21,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047207154] [2019-11-20 10:46:21,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:21,630 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 10:46:21,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047207154] [2019-11-20 10:46:21,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:21,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:21,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165014534] [2019-11-20 10:46:21,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:21,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:21,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:21,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:21,632 INFO L87 Difference]: Start difference. First operand 819 states and 1224 transitions. Second operand 4 states. [2019-11-20 10:46:22,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:22,069 INFO L93 Difference]: Finished difference Result 1709 states and 2548 transitions. [2019-11-20 10:46:22,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:22,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-20 10:46:22,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:22,071 INFO L225 Difference]: With dead ends: 1709 [2019-11-20 10:46:22,071 INFO L226 Difference]: Without dead ends: 909 [2019-11-20 10:46:22,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:22,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-20 10:46:22,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 819. [2019-11-20 10:46:22,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-11-20 10:46:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1222 transitions. [2019-11-20 10:46:22,110 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1222 transitions. Word has length 152 [2019-11-20 10:46:22,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:22,110 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 1222 transitions. [2019-11-20 10:46:22,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1222 transitions. [2019-11-20 10:46:22,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-20 10:46:22,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:22,112 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:22,112 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:22,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:22,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1128818102, now seen corresponding path program 1 times [2019-11-20 10:46:22,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:22,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288769692] [2019-11-20 10:46:22,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:22,176 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:46:22,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288769692] [2019-11-20 10:46:22,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:22,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:22,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809889380] [2019-11-20 10:46:22,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:22,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:22,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:22,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:22,178 INFO L87 Difference]: Start difference. First operand 819 states and 1222 transitions. Second operand 4 states. [2019-11-20 10:46:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:22,540 INFO L93 Difference]: Finished difference Result 1703 states and 2536 transitions. [2019-11-20 10:46:22,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:22,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-20 10:46:22,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:22,541 INFO L225 Difference]: With dead ends: 1703 [2019-11-20 10:46:22,541 INFO L226 Difference]: Without dead ends: 903 [2019-11-20 10:46:22,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:22,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-11-20 10:46:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 819. [2019-11-20 10:46:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-11-20 10:46:22,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1220 transitions. [2019-11-20 10:46:22,583 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1220 transitions. Word has length 152 [2019-11-20 10:46:22,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:22,585 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 1220 transitions. [2019-11-20 10:46:22,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:22,585 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1220 transitions. [2019-11-20 10:46:22,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-20 10:46:22,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:22,587 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:22,587 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:22,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:22,588 INFO L82 PathProgramCache]: Analyzing trace with hash 173535669, now seen corresponding path program 1 times [2019-11-20 10:46:22,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:22,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339281739] [2019-11-20 10:46:22,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:22,670 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:46:22,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339281739] [2019-11-20 10:46:22,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:22,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:22,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640121580] [2019-11-20 10:46:22,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:22,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:22,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:22,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:22,672 INFO L87 Difference]: Start difference. First operand 819 states and 1220 transitions. Second operand 4 states. [2019-11-20 10:46:22,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:22,995 INFO L93 Difference]: Finished difference Result 1685 states and 2509 transitions. [2019-11-20 10:46:22,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:22,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-20 10:46:22,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:22,996 INFO L225 Difference]: With dead ends: 1685 [2019-11-20 10:46:22,997 INFO L226 Difference]: Without dead ends: 885 [2019-11-20 10:46:22,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:22,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2019-11-20 10:46:23,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 821. [2019-11-20 10:46:23,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2019-11-20 10:46:23,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1222 transitions. [2019-11-20 10:46:23,026 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1222 transitions. Word has length 152 [2019-11-20 10:46:23,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:23,027 INFO L462 AbstractCegarLoop]: Abstraction has 821 states and 1222 transitions. [2019-11-20 10:46:23,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:23,027 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1222 transitions. [2019-11-20 10:46:23,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-20 10:46:23,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:23,028 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:23,028 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:23,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:23,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1223905309, now seen corresponding path program 1 times [2019-11-20 10:46:23,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:23,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213885715] [2019-11-20 10:46:23,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:23,098 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:46:23,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213885715] [2019-11-20 10:46:23,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:23,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:23,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115859518] [2019-11-20 10:46:23,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:23,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:23,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:23,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:23,100 INFO L87 Difference]: Start difference. First operand 821 states and 1222 transitions. Second operand 4 states. [2019-11-20 10:46:23,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:23,603 INFO L93 Difference]: Finished difference Result 1681 states and 2502 transitions. [2019-11-20 10:46:23,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:23,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-20 10:46:23,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:23,605 INFO L225 Difference]: With dead ends: 1681 [2019-11-20 10:46:23,605 INFO L226 Difference]: Without dead ends: 879 [2019-11-20 10:46:23,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:23,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-11-20 10:46:23,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 823. [2019-11-20 10:46:23,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-11-20 10:46:23,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1224 transitions. [2019-11-20 10:46:23,647 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1224 transitions. Word has length 153 [2019-11-20 10:46:23,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:23,648 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1224 transitions. [2019-11-20 10:46:23,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:23,648 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1224 transitions. [2019-11-20 10:46:23,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-20 10:46:23,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:23,650 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:23,651 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:23,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:23,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1915229475, now seen corresponding path program 1 times [2019-11-20 10:46:23,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:23,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308662251] [2019-11-20 10:46:23,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:46:23,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308662251] [2019-11-20 10:46:23,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:23,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:23,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485950452] [2019-11-20 10:46:23,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:23,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:23,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:23,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:23,730 INFO L87 Difference]: Start difference. First operand 823 states and 1224 transitions. Second operand 4 states. [2019-11-20 10:46:24,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:24,064 INFO L93 Difference]: Finished difference Result 1707 states and 2532 transitions. [2019-11-20 10:46:24,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:24,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-11-20 10:46:24,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:24,066 INFO L225 Difference]: With dead ends: 1707 [2019-11-20 10:46:24,066 INFO L226 Difference]: Without dead ends: 903 [2019-11-20 10:46:24,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:24,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-11-20 10:46:24,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 823. [2019-11-20 10:46:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-11-20 10:46:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1222 transitions. [2019-11-20 10:46:24,109 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1222 transitions. Word has length 155 [2019-11-20 10:46:24,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:24,109 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1222 transitions. [2019-11-20 10:46:24,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:24,109 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1222 transitions. [2019-11-20 10:46:24,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 10:46:24,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:24,112 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:24,112 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:24,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:24,112 INFO L82 PathProgramCache]: Analyzing trace with hash 570054113, now seen corresponding path program 1 times [2019-11-20 10:46:24,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:24,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059813622] [2019-11-20 10:46:24,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:46:24,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059813622] [2019-11-20 10:46:24,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:24,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:24,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977302798] [2019-11-20 10:46:24,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:24,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:24,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:24,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:24,196 INFO L87 Difference]: Start difference. First operand 823 states and 1222 transitions. Second operand 4 states. [2019-11-20 10:46:24,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:24,579 INFO L93 Difference]: Finished difference Result 1695 states and 2512 transitions. [2019-11-20 10:46:24,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:24,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-20 10:46:24,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:24,581 INFO L225 Difference]: With dead ends: 1695 [2019-11-20 10:46:24,581 INFO L226 Difference]: Without dead ends: 891 [2019-11-20 10:46:24,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:24,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2019-11-20 10:46:24,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 823. [2019-11-20 10:46:24,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-11-20 10:46:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1220 transitions. [2019-11-20 10:46:24,645 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1220 transitions. Word has length 156 [2019-11-20 10:46:24,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:24,645 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1220 transitions. [2019-11-20 10:46:24,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1220 transitions. [2019-11-20 10:46:24,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 10:46:24,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:24,647 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:24,647 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:24,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:24,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1768327197, now seen corresponding path program 1 times [2019-11-20 10:46:24,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:24,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431148978] [2019-11-20 10:46:24,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:24,725 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:46:24,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431148978] [2019-11-20 10:46:24,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:24,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:24,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68736900] [2019-11-20 10:46:24,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:24,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:24,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:24,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:24,727 INFO L87 Difference]: Start difference. First operand 823 states and 1220 transitions. Second operand 4 states. [2019-11-20 10:46:25,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:25,073 INFO L93 Difference]: Finished difference Result 1695 states and 2508 transitions. [2019-11-20 10:46:25,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:25,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-20 10:46:25,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:25,074 INFO L225 Difference]: With dead ends: 1695 [2019-11-20 10:46:25,074 INFO L226 Difference]: Without dead ends: 891 [2019-11-20 10:46:25,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:25,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2019-11-20 10:46:25,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 823. [2019-11-20 10:46:25,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-11-20 10:46:25,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1218 transitions. [2019-11-20 10:46:25,104 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1218 transitions. Word has length 156 [2019-11-20 10:46:25,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:25,104 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1218 transitions. [2019-11-20 10:46:25,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:25,104 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1218 transitions. [2019-11-20 10:46:25,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 10:46:25,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:25,105 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:25,106 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:25,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:25,106 INFO L82 PathProgramCache]: Analyzing trace with hash -370540048, now seen corresponding path program 1 times [2019-11-20 10:46:25,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:25,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006351422] [2019-11-20 10:46:25,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:25,188 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 10:46:25,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006351422] [2019-11-20 10:46:25,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:25,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:25,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195842434] [2019-11-20 10:46:25,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:25,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:25,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:25,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:25,190 INFO L87 Difference]: Start difference. First operand 823 states and 1218 transitions. Second operand 4 states. [2019-11-20 10:46:25,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:25,717 INFO L93 Difference]: Finished difference Result 1761 states and 2622 transitions. [2019-11-20 10:46:25,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:25,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-20 10:46:25,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:25,719 INFO L225 Difference]: With dead ends: 1761 [2019-11-20 10:46:25,719 INFO L226 Difference]: Without dead ends: 957 [2019-11-20 10:46:25,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:25,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2019-11-20 10:46:25,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 883. [2019-11-20 10:46:25,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-11-20 10:46:25,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1324 transitions. [2019-11-20 10:46:25,765 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1324 transitions. Word has length 156 [2019-11-20 10:46:25,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:25,765 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1324 transitions. [2019-11-20 10:46:25,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:25,766 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1324 transitions. [2019-11-20 10:46:25,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-20 10:46:25,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:25,768 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:25,768 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:25,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:25,769 INFO L82 PathProgramCache]: Analyzing trace with hash 637903039, now seen corresponding path program 1 times [2019-11-20 10:46:25,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:25,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759291550] [2019-11-20 10:46:25,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:25,848 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:46:25,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759291550] [2019-11-20 10:46:25,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:25,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:25,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995347376] [2019-11-20 10:46:25,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:25,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:25,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:25,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:25,850 INFO L87 Difference]: Start difference. First operand 883 states and 1324 transitions. Second operand 4 states. [2019-11-20 10:46:26,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:26,192 INFO L93 Difference]: Finished difference Result 1809 states and 2709 transitions. [2019-11-20 10:46:26,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:26,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-20 10:46:26,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:26,194 INFO L225 Difference]: With dead ends: 1809 [2019-11-20 10:46:26,194 INFO L226 Difference]: Without dead ends: 945 [2019-11-20 10:46:26,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:26,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-11-20 10:46:26,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 883. [2019-11-20 10:46:26,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-11-20 10:46:26,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1322 transitions. [2019-11-20 10:46:26,226 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1322 transitions. Word has length 157 [2019-11-20 10:46:26,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:26,226 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1322 transitions. [2019-11-20 10:46:26,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:26,226 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1322 transitions. [2019-11-20 10:46:26,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-20 10:46:26,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:26,227 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:26,228 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:26,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:26,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1858901419, now seen corresponding path program 1 times [2019-11-20 10:46:26,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:26,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052525361] [2019-11-20 10:46:26,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:46:26,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052525361] [2019-11-20 10:46:26,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:26,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:26,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316486892] [2019-11-20 10:46:26,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:26,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:26,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:26,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:26,290 INFO L87 Difference]: Start difference. First operand 883 states and 1322 transitions. Second operand 4 states. [2019-11-20 10:46:26,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:26,640 INFO L93 Difference]: Finished difference Result 1809 states and 2705 transitions. [2019-11-20 10:46:26,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:26,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-20 10:46:26,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:26,641 INFO L225 Difference]: With dead ends: 1809 [2019-11-20 10:46:26,641 INFO L226 Difference]: Without dead ends: 945 [2019-11-20 10:46:26,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:26,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-11-20 10:46:26,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 883. [2019-11-20 10:46:26,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-11-20 10:46:26,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1320 transitions. [2019-11-20 10:46:26,671 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1320 transitions. Word has length 158 [2019-11-20 10:46:26,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:26,672 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1320 transitions. [2019-11-20 10:46:26,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:26,672 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1320 transitions. [2019-11-20 10:46:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-20 10:46:26,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:26,674 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:26,674 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:26,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:26,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1930636007, now seen corresponding path program 1 times [2019-11-20 10:46:26,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:26,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476585724] [2019-11-20 10:46:26,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:26,739 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:46:26,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476585724] [2019-11-20 10:46:26,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:26,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:26,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348895114] [2019-11-20 10:46:26,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:26,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:26,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:26,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:26,741 INFO L87 Difference]: Start difference. First operand 883 states and 1320 transitions. Second operand 4 states. [2019-11-20 10:46:27,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:27,093 INFO L93 Difference]: Finished difference Result 1803 states and 2694 transitions. [2019-11-20 10:46:27,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:27,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-11-20 10:46:27,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:27,094 INFO L225 Difference]: With dead ends: 1803 [2019-11-20 10:46:27,094 INFO L226 Difference]: Without dead ends: 939 [2019-11-20 10:46:27,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:27,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2019-11-20 10:46:27,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 807. [2019-11-20 10:46:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2019-11-20 10:46:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2019-11-20 10:46:27,125 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 159 [2019-11-20 10:46:27,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:27,125 INFO L462 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2019-11-20 10:46:27,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2019-11-20 10:46:27,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-20 10:46:27,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:27,126 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:27,127 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:27,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:27,127 INFO L82 PathProgramCache]: Analyzing trace with hash 515522094, now seen corresponding path program 1 times [2019-11-20 10:46:27,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:27,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847786626] [2019-11-20 10:46:27,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:27,186 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-20 10:46:27,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847786626] [2019-11-20 10:46:27,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:27,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:27,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992180349] [2019-11-20 10:46:27,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:27,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:27,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:27,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:27,187 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 4 states. [2019-11-20 10:46:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:27,554 INFO L93 Difference]: Finished difference Result 1727 states and 2580 transitions. [2019-11-20 10:46:27,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:27,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-11-20 10:46:27,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:27,556 INFO L225 Difference]: With dead ends: 1727 [2019-11-20 10:46:27,556 INFO L226 Difference]: Without dead ends: 939 [2019-11-20 10:46:27,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:27,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2019-11-20 10:46:27,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 867. [2019-11-20 10:46:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2019-11-20 10:46:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1298 transitions. [2019-11-20 10:46:27,596 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1298 transitions. Word has length 159 [2019-11-20 10:46:27,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:27,596 INFO L462 AbstractCegarLoop]: Abstraction has 867 states and 1298 transitions. [2019-11-20 10:46:27,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:27,596 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1298 transitions. [2019-11-20 10:46:27,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-20 10:46:27,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:27,598 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:27,598 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:27,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:27,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1330228607, now seen corresponding path program 1 times [2019-11-20 10:46:27,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:27,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986730804] [2019-11-20 10:46:27,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:27,670 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-20 10:46:27,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986730804] [2019-11-20 10:46:27,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:27,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:27,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471219445] [2019-11-20 10:46:27,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:27,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:27,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:27,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:27,673 INFO L87 Difference]: Start difference. First operand 867 states and 1298 transitions. Second operand 4 states. [2019-11-20 10:46:28,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:28,043 INFO L93 Difference]: Finished difference Result 1765 states and 2646 transitions. [2019-11-20 10:46:28,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:28,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-11-20 10:46:28,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:28,044 INFO L225 Difference]: With dead ends: 1765 [2019-11-20 10:46:28,044 INFO L226 Difference]: Without dead ends: 917 [2019-11-20 10:46:28,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:28,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-11-20 10:46:28,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 867. [2019-11-20 10:46:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2019-11-20 10:46:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1296 transitions. [2019-11-20 10:46:28,075 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1296 transitions. Word has length 159 [2019-11-20 10:46:28,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:28,075 INFO L462 AbstractCegarLoop]: Abstraction has 867 states and 1296 transitions. [2019-11-20 10:46:28,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:28,075 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1296 transitions. [2019-11-20 10:46:28,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-20 10:46:28,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:28,076 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:28,076 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:28,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:28,077 INFO L82 PathProgramCache]: Analyzing trace with hash 762046113, now seen corresponding path program 1 times [2019-11-20 10:46:28,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:28,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278309406] [2019-11-20 10:46:28,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:28,132 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-20 10:46:28,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278309406] [2019-11-20 10:46:28,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:28,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:28,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098203181] [2019-11-20 10:46:28,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:28,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:28,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:28,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:28,134 INFO L87 Difference]: Start difference. First operand 867 states and 1296 transitions. Second operand 4 states. [2019-11-20 10:46:28,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:28,490 INFO L93 Difference]: Finished difference Result 1783 states and 2660 transitions. [2019-11-20 10:46:28,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:28,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-11-20 10:46:28,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:28,492 INFO L225 Difference]: With dead ends: 1783 [2019-11-20 10:46:28,492 INFO L226 Difference]: Without dead ends: 935 [2019-11-20 10:46:28,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:28,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2019-11-20 10:46:28,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 869. [2019-11-20 10:46:28,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-11-20 10:46:28,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1298 transitions. [2019-11-20 10:46:28,522 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1298 transitions. Word has length 160 [2019-11-20 10:46:28,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:28,523 INFO L462 AbstractCegarLoop]: Abstraction has 869 states and 1298 transitions. [2019-11-20 10:46:28,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:28,523 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1298 transitions. [2019-11-20 10:46:28,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-20 10:46:28,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:28,524 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:28,524 INFO L410 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:28,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:28,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1252382390, now seen corresponding path program 1 times [2019-11-20 10:46:28,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:28,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799057882] [2019-11-20 10:46:28,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-20 10:46:28,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799057882] [2019-11-20 10:46:28,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:28,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:28,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378080058] [2019-11-20 10:46:28,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:28,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:28,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:28,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:28,592 INFO L87 Difference]: Start difference. First operand 869 states and 1298 transitions. Second operand 4 states. [2019-11-20 10:46:28,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:28,928 INFO L93 Difference]: Finished difference Result 1765 states and 2642 transitions. [2019-11-20 10:46:28,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:28,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-11-20 10:46:28,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:28,929 INFO L225 Difference]: With dead ends: 1765 [2019-11-20 10:46:28,929 INFO L226 Difference]: Without dead ends: 915 [2019-11-20 10:46:28,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:28,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-11-20 10:46:28,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 869. [2019-11-20 10:46:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-11-20 10:46:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1296 transitions. [2019-11-20 10:46:28,959 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1296 transitions. Word has length 160 [2019-11-20 10:46:28,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:28,959 INFO L462 AbstractCegarLoop]: Abstraction has 869 states and 1296 transitions. [2019-11-20 10:46:28,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:28,959 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1296 transitions. [2019-11-20 10:46:28,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-20 10:46:28,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:28,960 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:28,960 INFO L410 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:28,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:28,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1357963213, now seen corresponding path program 1 times [2019-11-20 10:46:28,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:28,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608137835] [2019-11-20 10:46:28,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:46:29,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608137835] [2019-11-20 10:46:29,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:29,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:29,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259115061] [2019-11-20 10:46:29,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:29,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:29,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:29,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:29,031 INFO L87 Difference]: Start difference. First operand 869 states and 1296 transitions. Second operand 4 states. [2019-11-20 10:46:29,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:29,363 INFO L93 Difference]: Finished difference Result 1785 states and 2656 transitions. [2019-11-20 10:46:29,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:29,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-20 10:46:29,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:29,364 INFO L225 Difference]: With dead ends: 1785 [2019-11-20 10:46:29,364 INFO L226 Difference]: Without dead ends: 935 [2019-11-20 10:46:29,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2019-11-20 10:46:29,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 893. [2019-11-20 10:46:29,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2019-11-20 10:46:29,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1324 transitions. [2019-11-20 10:46:29,406 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1324 transitions. Word has length 161 [2019-11-20 10:46:29,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:29,406 INFO L462 AbstractCegarLoop]: Abstraction has 893 states and 1324 transitions. [2019-11-20 10:46:29,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1324 transitions. [2019-11-20 10:46:29,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-20 10:46:29,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:29,408 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:29,408 INFO L410 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:29,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:29,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1425723221, now seen corresponding path program 1 times [2019-11-20 10:46:29,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:29,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22025317] [2019-11-20 10:46:29,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:46:29,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22025317] [2019-11-20 10:46:29,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:29,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:29,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125303666] [2019-11-20 10:46:29,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:29,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:29,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:29,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:29,492 INFO L87 Difference]: Start difference. First operand 893 states and 1324 transitions. Second operand 4 states. [2019-11-20 10:46:29,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:29,837 INFO L93 Difference]: Finished difference Result 1801 states and 2672 transitions. [2019-11-20 10:46:29,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:29,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-20 10:46:29,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:29,839 INFO L225 Difference]: With dead ends: 1801 [2019-11-20 10:46:29,839 INFO L226 Difference]: Without dead ends: 923 [2019-11-20 10:46:29,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-11-20 10:46:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 891. [2019-11-20 10:46:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2019-11-20 10:46:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1320 transitions. [2019-11-20 10:46:29,871 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1320 transitions. Word has length 162 [2019-11-20 10:46:29,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:29,871 INFO L462 AbstractCegarLoop]: Abstraction has 891 states and 1320 transitions. [2019-11-20 10:46:29,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1320 transitions. [2019-11-20 10:46:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-20 10:46:29,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:29,872 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:29,872 INFO L410 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:29,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:29,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1881078131, now seen corresponding path program 1 times [2019-11-20 10:46:29,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:29,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475173797] [2019-11-20 10:46:29,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 10:46:30,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475173797] [2019-11-20 10:46:30,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:30,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 10:46:30,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387899333] [2019-11-20 10:46:30,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:46:30,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:30,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:46:30,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:30,038 INFO L87 Difference]: Start difference. First operand 891 states and 1320 transitions. Second operand 5 states. [2019-11-20 10:46:30,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:30,618 INFO L93 Difference]: Finished difference Result 1921 states and 2862 transitions. [2019-11-20 10:46:30,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 10:46:30,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2019-11-20 10:46:30,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:30,619 INFO L225 Difference]: With dead ends: 1921 [2019-11-20 10:46:30,620 INFO L226 Difference]: Without dead ends: 1049 [2019-11-20 10:46:30,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:46:30,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-11-20 10:46:30,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 957. [2019-11-20 10:46:30,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-11-20 10:46:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1438 transitions. [2019-11-20 10:46:30,653 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1438 transitions. Word has length 162 [2019-11-20 10:46:30,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:30,654 INFO L462 AbstractCegarLoop]: Abstraction has 957 states and 1438 transitions. [2019-11-20 10:46:30,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:46:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1438 transitions. [2019-11-20 10:46:30,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-20 10:46:30,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:30,655 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:30,655 INFO L410 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:30,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:30,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1044817544, now seen corresponding path program 1 times [2019-11-20 10:46:30,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:30,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654260266] [2019-11-20 10:46:30,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:30,742 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 10:46:30,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654260266] [2019-11-20 10:46:30,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:30,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:30,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976534956] [2019-11-20 10:46:30,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:30,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:30,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:30,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:30,745 INFO L87 Difference]: Start difference. First operand 957 states and 1438 transitions. Second operand 4 states. [2019-11-20 10:46:31,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:31,123 INFO L93 Difference]: Finished difference Result 1947 states and 2926 transitions. [2019-11-20 10:46:31,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:31,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-20 10:46:31,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:31,125 INFO L225 Difference]: With dead ends: 1947 [2019-11-20 10:46:31,125 INFO L226 Difference]: Without dead ends: 1009 [2019-11-20 10:46:31,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:31,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2019-11-20 10:46:31,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 957. [2019-11-20 10:46:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-11-20 10:46:31,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1436 transitions. [2019-11-20 10:46:31,158 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1436 transitions. Word has length 165 [2019-11-20 10:46:31,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:31,158 INFO L462 AbstractCegarLoop]: Abstraction has 957 states and 1436 transitions. [2019-11-20 10:46:31,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:31,158 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1436 transitions. [2019-11-20 10:46:31,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-20 10:46:31,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:31,159 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:31,160 INFO L410 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:31,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:31,160 INFO L82 PathProgramCache]: Analyzing trace with hash -363842409, now seen corresponding path program 1 times [2019-11-20 10:46:31,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:31,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529897155] [2019-11-20 10:46:31,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:31,270 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 10:46:31,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529897155] [2019-11-20 10:46:31,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:31,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:31,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603283341] [2019-11-20 10:46:31,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:31,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:31,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:31,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:31,273 INFO L87 Difference]: Start difference. First operand 957 states and 1436 transitions. Second operand 4 states. [2019-11-20 10:46:31,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:31,672 INFO L93 Difference]: Finished difference Result 1943 states and 2918 transitions. [2019-11-20 10:46:31,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:31,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-20 10:46:31,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:31,674 INFO L225 Difference]: With dead ends: 1943 [2019-11-20 10:46:31,674 INFO L226 Difference]: Without dead ends: 1005 [2019-11-20 10:46:31,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:31,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-11-20 10:46:31,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 957. [2019-11-20 10:46:31,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-11-20 10:46:31,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1434 transitions. [2019-11-20 10:46:31,709 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1434 transitions. Word has length 166 [2019-11-20 10:46:31,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:31,709 INFO L462 AbstractCegarLoop]: Abstraction has 957 states and 1434 transitions. [2019-11-20 10:46:31,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:31,710 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1434 transitions. [2019-11-20 10:46:31,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-20 10:46:31,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:31,711 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] [2019-11-20 10:46:31,711 INFO L410 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:31,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:31,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1900769027, now seen corresponding path program 1 times [2019-11-20 10:46:31,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:31,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930478389] [2019-11-20 10:46:31,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:32,021 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:46:32,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930478389] [2019-11-20 10:46:32,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594800510] [2019-11-20 10:46:32,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:46:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:32,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-20 10:46:32,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:46:32,398 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:32,398 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-20 10:46:32,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:32,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:32,452 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_162|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-11-20 10:46:32,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:32,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:32,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:32,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:32,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:32,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:32,517 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 10:46:32,517 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:32,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:32,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:32,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:32,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:32,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:32,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:32,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:32,591 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 10:46:32,591 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:32,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:32,685 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 10:46:32,685 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 10:46:32,686 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:32,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:32,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:46:32,713 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-20 10:46:32,790 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 10:46:32,790 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 10:46:32,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:32,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:32,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:46:32,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 10:46:32,865 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 10:46:32,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 10:46:32,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:32,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:32,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:46:32,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 10:46:32,879 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_165|]} [2019-11-20 10:46:32,884 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:46:32,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:32,994 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-20 10:46:32,994 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-20 10:46:32,995 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:33,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:33,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:46:33,014 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-20 10:46:33,069 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 10:46:33,070 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 10:46:33,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:33,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:33,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:46:33,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 10:46:33,124 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 10:46:33,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 10:46:33,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:33,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:33,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:46:33,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 10:46:33,155 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_168|]} [2019-11-20 10:46:33,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:33,166 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-11-20 10:46:33,166 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 10:46:33,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:33,397 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-11-20 10:46:33,398 INFO L343 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2019-11-20 10:46:33,398 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-11-20 10:46:33,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:33,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:33,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:34,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:34,136 INFO L496 ElimStorePlain]: Start of recursive call 3: 24 dim-0 vars, End of recursive call: 24 dim-0 vars, and 3 xjuncts. [2019-11-20 10:46:35,759 WARN L191 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 481 DAG size of output: 288 [2019-11-20 10:46:35,760 INFO L567 ElimStorePlain]: treesize reduction 3372, result has 33.0 percent of original size [2019-11-20 10:46:35,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:35,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 10:46:35,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:35,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:35,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 44 dim-0 vars, and 3 xjuncts. [2019-11-20 10:46:35,782 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:2111 [2019-11-20 10:46:36,144 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 347 DAG size of output: 35 [2019-11-20 10:46:36,214 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2019-11-20 10:46:36,217 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:46:36,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:36,536 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2019-11-20 10:46:36,541 INFO L343 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2019-11-20 10:46:36,541 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 104 treesize of output 142 [2019-11-20 10:46:36,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:36,544 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:36,593 INFO L567 ElimStorePlain]: treesize reduction 69, result has 56.3 percent of original size [2019-11-20 10:46:36,593 INFO L496 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-11-20 10:46:36,594 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2019-11-20 10:46:37,476 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 30=[|v_#memory_$Pointer$.base_170|]} [2019-11-20 10:46:37,481 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 10:46:37,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:37,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:37,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:37,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:37,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:37,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:37,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:37,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:37,654 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-11-20 10:46:37,655 INFO L343 Elim1Store]: treesize reduction 56, result has 73.5 percent of original size [2019-11-20 10:46:37,655 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 99 treesize of output 207 [2019-11-20 10:46:37,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:37,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:37,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:37,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:37,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:37,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:37,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:37,665 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:37,894 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 40 [2019-11-20 10:46:37,895 INFO L567 ElimStorePlain]: treesize reduction 7053, result has 1.2 percent of original size [2019-11-20 10:46:37,896 INFO L496 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-11-20 10:46:37,896 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:89 [2019-11-20 10:46:37,947 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 2=[|v_#memory_int_179|], 20=[|v_#memory_$Pointer$.base_171|]} [2019-11-20 10:46:37,957 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-11-20 10:46:37,958 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:46:37,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:37,994 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2019-11-20 10:46:37,995 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:38,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:38,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:38,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:38,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:38,089 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:38,089 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 95 treesize of output 147 [2019-11-20 10:46:38,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:38,226 INFO L496 ElimStorePlain]: Start of recursive call 4: 150 dim-0 vars, End of recursive call: 151 dim-0 vars, and 14 xjuncts. [2019-11-20 10:46:43,912 WARN L191 SmtUtils]: Spent 5.68 s on a formula simplification. DAG size of input: 1094 DAG size of output: 1034 [2019-11-20 10:46:43,913 INFO L567 ElimStorePlain]: treesize reduction 320, result has 89.6 percent of original size [2019-11-20 10:46:43,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 10:46:43,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 10:46:43,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:43,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 13 terms [2019-11-20 10:46:43,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:43,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 10:46:43,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:43,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-11-20 10:46:43,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 10:46:43,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:43,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:43,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:43,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-11-20 10:46:43,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 10:46:43,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:43,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-11-20 10:46:43,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:43,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 10:46:43,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:43,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:43,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 10:46:43,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:43,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 10:46:43,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:43,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:43,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:43,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-11-20 10:46:43,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:43,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 10:46:43,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:43,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 10:46:43,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:43,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 10:46:43,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:43,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 262 dim-0 vars, and 1 xjuncts. [2019-11-20 10:46:43,987 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:120, output treesize:1845 [2019-11-20 10:46:45,458 WARN L191 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 1323 DAG size of output: 22 [2019-11-20 10:46:45,471 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-20 10:46:45,471 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 1 case distinctions, treesize of input 32 treesize of output 34 [2019-11-20 10:46:45,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:45,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:45,480 INFO L496 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-11-20 10:46:45,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2019-11-20 10:46:45,536 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 10:46:45,536 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2019-11-20 10:46:45,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:45,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:45,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:46:45,541 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-11-20 10:46:45,858 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 64 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:46:45,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:46:45,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-11-20 10:46:45,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447122450] [2019-11-20 10:46:45,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 10:46:45,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:45,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 10:46:45,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-20 10:46:45,861 INFO L87 Difference]: Start difference. First operand 957 states and 1434 transitions. Second operand 13 states. [2019-11-20 10:46:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:50,173 INFO L93 Difference]: Finished difference Result 3593 states and 5360 transitions. [2019-11-20 10:46:50,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 10:46:50,173 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 167 [2019-11-20 10:46:50,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:50,184 INFO L225 Difference]: With dead ends: 3593 [2019-11-20 10:46:50,185 INFO L226 Difference]: Without dead ends: 2655 [2019-11-20 10:46:50,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 122 SyntacticMatches, 47 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-11-20 10:46:50,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2019-11-20 10:46:50,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 1784. [2019-11-20 10:46:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-11-20 10:46:50,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2674 transitions. [2019-11-20 10:46:50,321 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2674 transitions. Word has length 167 [2019-11-20 10:46:50,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:50,321 INFO L462 AbstractCegarLoop]: Abstraction has 1784 states and 2674 transitions. [2019-11-20 10:46:50,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 10:46:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2674 transitions. [2019-11-20 10:46:50,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-20 10:46:50,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:50,325 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:50,531 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:46:50,531 INFO L410 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:50,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:50,532 INFO L82 PathProgramCache]: Analyzing trace with hash -456243620, now seen corresponding path program 1 times [2019-11-20 10:46:50,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:50,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577705396] [2019-11-20 10:46:50,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:50,681 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 10:46:50,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577705396] [2019-11-20 10:46:50,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:50,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:50,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873191391] [2019-11-20 10:46:50,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:50,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:50,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:50,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:50,684 INFO L87 Difference]: Start difference. First operand 1784 states and 2674 transitions. Second operand 4 states. [2019-11-20 10:46:51,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:51,356 INFO L93 Difference]: Finished difference Result 2850 states and 4262 transitions. [2019-11-20 10:46:51,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:51,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-11-20 10:46:51,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:51,359 INFO L225 Difference]: With dead ends: 2850 [2019-11-20 10:46:51,360 INFO L226 Difference]: Without dead ends: 1912 [2019-11-20 10:46:51,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:51,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2019-11-20 10:46:51,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1784. [2019-11-20 10:46:51,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-11-20 10:46:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2670 transitions. [2019-11-20 10:46:51,474 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2670 transitions. Word has length 171 [2019-11-20 10:46:51,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:51,474 INFO L462 AbstractCegarLoop]: Abstraction has 1784 states and 2670 transitions. [2019-11-20 10:46:51,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:51,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2670 transitions. [2019-11-20 10:46:51,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-20 10:46:51,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:51,477 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:51,477 INFO L410 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:51,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:51,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1193301233, now seen corresponding path program 1 times [2019-11-20 10:46:51,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:51,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939146672] [2019-11-20 10:46:51,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 10:46:51,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939146672] [2019-11-20 10:46:51,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:51,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:51,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306336162] [2019-11-20 10:46:51,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:51,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:51,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:51,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:51,597 INFO L87 Difference]: Start difference. First operand 1784 states and 2670 transitions. Second operand 4 states. [2019-11-20 10:46:52,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:52,296 INFO L93 Difference]: Finished difference Result 2850 states and 4256 transitions. [2019-11-20 10:46:52,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:52,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-11-20 10:46:52,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:52,310 INFO L225 Difference]: With dead ends: 2850 [2019-11-20 10:46:52,310 INFO L226 Difference]: Without dead ends: 1912 [2019-11-20 10:46:52,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:52,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2019-11-20 10:46:52,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1784. [2019-11-20 10:46:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-11-20 10:46:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2666 transitions. [2019-11-20 10:46:52,433 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2666 transitions. Word has length 172 [2019-11-20 10:46:52,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:52,434 INFO L462 AbstractCegarLoop]: Abstraction has 1784 states and 2666 transitions. [2019-11-20 10:46:52,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:52,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2666 transitions. [2019-11-20 10:46:52,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-20 10:46:52,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:52,437 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:52,438 INFO L410 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:52,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:52,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1302488063, now seen corresponding path program 1 times [2019-11-20 10:46:52,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:52,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992424663] [2019-11-20 10:46:52,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 10:46:52,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992424663] [2019-11-20 10:46:52,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:52,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:52,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024869367] [2019-11-20 10:46:52,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:52,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:52,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:52,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:52,643 INFO L87 Difference]: Start difference. First operand 1784 states and 2666 transitions. Second operand 4 states. [2019-11-20 10:46:53,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:53,253 INFO L93 Difference]: Finished difference Result 2850 states and 4250 transitions. [2019-11-20 10:46:53,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:53,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-11-20 10:46:53,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:53,257 INFO L225 Difference]: With dead ends: 2850 [2019-11-20 10:46:53,257 INFO L226 Difference]: Without dead ends: 1912 [2019-11-20 10:46:53,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:53,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2019-11-20 10:46:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1784. [2019-11-20 10:46:53,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-11-20 10:46:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2662 transitions. [2019-11-20 10:46:53,375 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2662 transitions. Word has length 173 [2019-11-20 10:46:53,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:53,376 INFO L462 AbstractCegarLoop]: Abstraction has 1784 states and 2662 transitions. [2019-11-20 10:46:53,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:53,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2662 transitions. [2019-11-20 10:46:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 10:46:53,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:53,378 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:53,379 INFO L410 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:53,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:53,379 INFO L82 PathProgramCache]: Analyzing trace with hash 872450196, now seen corresponding path program 1 times [2019-11-20 10:46:53,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:53,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026336465] [2019-11-20 10:46:53,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:53,464 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 10:46:53,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026336465] [2019-11-20 10:46:53,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:53,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:46:53,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428420568] [2019-11-20 10:46:53,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:46:53,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:53,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:46:53,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:46:53,467 INFO L87 Difference]: Start difference. First operand 1784 states and 2662 transitions. Second operand 4 states. [2019-11-20 10:46:54,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:54,071 INFO L93 Difference]: Finished difference Result 2830 states and 4220 transitions. [2019-11-20 10:46:54,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:54,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-11-20 10:46:54,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:54,076 INFO L225 Difference]: With dead ends: 2830 [2019-11-20 10:46:54,076 INFO L226 Difference]: Without dead ends: 1892 [2019-11-20 10:46:54,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-11-20 10:46:54,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2019-11-20 10:46:54,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1784. [2019-11-20 10:46:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-11-20 10:46:54,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2658 transitions. [2019-11-20 10:46:54,187 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2658 transitions. Word has length 174 [2019-11-20 10:46:54,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:54,188 INFO L462 AbstractCegarLoop]: Abstraction has 1784 states and 2658 transitions. [2019-11-20 10:46:54,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:46:54,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2658 transitions. [2019-11-20 10:46:54,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-20 10:46:54,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:54,190 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:54,190 INFO L410 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:54,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:54,191 INFO L82 PathProgramCache]: Analyzing trace with hash -623839111, now seen corresponding path program 1 times [2019-11-20 10:46:54,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:54,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115181280] [2019-11-20 10:46:54,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-20 10:46:54,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115181280] [2019-11-20 10:46:54,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:54,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 10:46:54,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526681276] [2019-11-20 10:46:54,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:46:54,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:54,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:46:54,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:54,338 INFO L87 Difference]: Start difference. First operand 1784 states and 2658 transitions. Second operand 5 states. [2019-11-20 10:46:55,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:55,145 INFO L93 Difference]: Finished difference Result 4072 states and 6120 transitions. [2019-11-20 10:46:55,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:55,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 177 [2019-11-20 10:46:55,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:55,150 INFO L225 Difference]: With dead ends: 4072 [2019-11-20 10:46:55,151 INFO L226 Difference]: Without dead ends: 2307 [2019-11-20 10:46:55,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:46:55,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-11-20 10:46:55,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 1942. [2019-11-20 10:46:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-11-20 10:46:55,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2944 transitions. [2019-11-20 10:46:55,275 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2944 transitions. Word has length 177 [2019-11-20 10:46:55,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:55,275 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 2944 transitions. [2019-11-20 10:46:55,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:46:55,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2944 transitions. [2019-11-20 10:46:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 10:46:55,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:55,278 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:55,278 INFO L410 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:55,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:55,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1894627737, now seen corresponding path program 1 times [2019-11-20 10:46:55,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:55,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983660350] [2019-11-20 10:46:55,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:55,412 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-20 10:46:55,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983660350] [2019-11-20 10:46:55,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:46:55,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 10:46:55,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834689583] [2019-11-20 10:46:55,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:46:55,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:55,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:46:55,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:46:55,414 INFO L87 Difference]: Start difference. First operand 1942 states and 2944 transitions. Second operand 5 states. [2019-11-20 10:46:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:56,119 INFO L93 Difference]: Finished difference Result 4276 states and 6510 transitions. [2019-11-20 10:46:56,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:46:56,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-11-20 10:46:56,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:56,122 INFO L225 Difference]: With dead ends: 4276 [2019-11-20 10:46:56,122 INFO L226 Difference]: Without dead ends: 2353 [2019-11-20 10:46:56,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:46:56,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2019-11-20 10:46:56,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2050. [2019-11-20 10:46:56,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2050 states. [2019-11-20 10:46:56,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3164 transitions. [2019-11-20 10:46:56,245 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 3164 transitions. Word has length 178 [2019-11-20 10:46:56,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:56,245 INFO L462 AbstractCegarLoop]: Abstraction has 2050 states and 3164 transitions. [2019-11-20 10:46:56,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:46:56,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 3164 transitions. [2019-11-20 10:46:56,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-20 10:46:56,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:56,247 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:56,247 INFO L410 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:56,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:56,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1918301126, now seen corresponding path program 1 times [2019-11-20 10:46:56,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:56,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119520624] [2019-11-20 10:46:56,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 10:46:56,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119520624] [2019-11-20 10:46:56,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571903048] [2019-11-20 10:46:56,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:46:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:46:56,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-20 10:46:56,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:46:56,948 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:56,948 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-20 10:46:56,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:57,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:57,021 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_177|], 2=[|v_#memory_$Pointer$.base_173|, |v_#memory_$Pointer$.base_172|]} [2019-11-20 10:46:57,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:57,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:57,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:57,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:57,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:57,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:57,077 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 10:46:57,078 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:57,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:57,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:57,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:57,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:57,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:57,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:57,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:46:57,146 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 10:46:57,146 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:57,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:57,224 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 10:46:57,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 10:46:57,225 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:57,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:57,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:46:57,244 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-20 10:46:57,327 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 10:46:57,327 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 10:46:57,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:57,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:57,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:46:57,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 10:46:57,386 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 10:46:57,386 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 10:46:57,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:57,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:57,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:46:57,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 10:46:57,400 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_174|], 12=[|v_#memory_$Pointer$.base_180|]} [2019-11-20 10:46:57,402 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:46:57,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:57,499 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-20 10:46:57,500 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-20 10:46:57,500 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:57,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:57,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:46:57,520 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-20 10:46:57,565 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 10:46:57,565 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 10:46:57,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:57,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:57,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:46:57,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 10:46:57,634 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 10:46:57,634 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 10:46:57,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:57,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:57,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:46:57,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 10:46:57,657 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_175|], 12=[|v_#memory_$Pointer$.base_183|]} [2019-11-20 10:46:57,659 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:46:57,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:57,755 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-20 10:46:57,755 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-20 10:46:57,756 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:57,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:57,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:46:57,774 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-20 10:46:57,789 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_181|], 2=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_184|]} [2019-11-20 10:46:57,796 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2019-11-20 10:46:57,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:57,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:57,830 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-11-20 10:46:57,831 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:57,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:58,013 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-11-20 10:46:58,013 INFO L343 Elim1Store]: treesize reduction 36, result has 84.9 percent of original size [2019-11-20 10:46:58,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 263 [2019-11-20 10:46:58,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:58,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:58,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:58,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:58,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:58,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:58,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:46:58,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:58,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:46:58,020 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:58,143 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2019-11-20 10:46:58,143 INFO L567 ElimStorePlain]: treesize reduction 1073, result has 6.5 percent of original size [2019-11-20 10:46:58,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:46:58,144 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:182, output treesize:74 [2019-11-20 10:46:58,178 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 43 treesize of output 31 [2019-11-20 10:46:58,179 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:46:58,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:58,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2019-11-20 10:46:58,202 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:46:58,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:46:58,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:46:58,220 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:56 [2019-11-20 10:46:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-20 10:46:58,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:46:58,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-11-20 10:46:58,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286673716] [2019-11-20 10:46:58,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:46:58,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:46:58,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:46:58,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:46:58,366 INFO L87 Difference]: Start difference. First operand 2050 states and 3164 transitions. Second operand 5 states. [2019-11-20 10:46:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:46:59,384 INFO L93 Difference]: Finished difference Result 5118 states and 7874 transitions. [2019-11-20 10:46:59,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 10:46:59,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2019-11-20 10:46:59,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:46:59,387 INFO L225 Difference]: With dead ends: 5118 [2019-11-20 10:46:59,387 INFO L226 Difference]: Without dead ends: 3087 [2019-11-20 10:46:59,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:46:59,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3087 states. [2019-11-20 10:46:59,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3087 to 2054. [2019-11-20 10:46:59,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2054 states. [2019-11-20 10:46:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 3168 transitions. [2019-11-20 10:46:59,467 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 3168 transitions. Word has length 191 [2019-11-20 10:46:59,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:46:59,467 INFO L462 AbstractCegarLoop]: Abstraction has 2054 states and 3168 transitions. [2019-11-20 10:46:59,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:46:59,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 3168 transitions. [2019-11-20 10:46:59,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-20 10:46:59,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:46:59,469 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:46:59,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:46:59,670 INFO L410 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:46:59,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:46:59,670 INFO L82 PathProgramCache]: Analyzing trace with hash -529007112, now seen corresponding path program 1 times [2019-11-20 10:46:59,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:46:59,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088952940] [2019-11-20 10:46:59,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:46:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:47:00,021 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 10:47:00,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088952940] [2019-11-20 10:47:00,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730800201] [2019-11-20 10:47:00,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:47:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:47:00,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-20 10:47:00,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:47:00,312 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:00,312 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-20 10:47:00,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:00,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:00,394 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_192|], 2=[|v_#memory_$Pointer$.base_186|, |v_#memory_$Pointer$.base_185|]} [2019-11-20 10:47:00,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:00,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:00,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:00,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:00,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:00,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:00,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 10:47:00,442 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:00,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:00,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:00,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:00,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:00,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:00,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:00,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:00,481 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 10:47:00,482 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:00,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:00,557 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 10:47:00,557 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 10:47:00,558 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:00,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:00,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:00,584 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-20 10:47:00,651 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 10:47:00,652 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 10:47:00,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:00,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:00,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:00,663 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 10:47:00,707 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 10:47:00,707 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 10:47:00,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:00,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:00,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:00,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 10:47:00,729 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_187|], 12=[|v_#memory_$Pointer$.base_195|]} [2019-11-20 10:47:00,731 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:47:00,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:00,832 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-20 10:47:00,832 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-20 10:47:00,833 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:00,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:00,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:00,851 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-20 10:47:00,892 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 10:47:00,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 10:47:00,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:00,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:00,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:00,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 10:47:00,951 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 10:47:00,951 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 10:47:00,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:00,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:00,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:00,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 10:47:00,973 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_188|], 12=[|v_#memory_$Pointer$.base_198|]} [2019-11-20 10:47:00,975 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:47:00,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:01,050 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-20 10:47:01,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-20 10:47:01,051 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:01,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:01,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:01,061 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-20 10:47:01,065 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_163|], 12=[|v_#memory_$Pointer$.base_199|]} [2019-11-20 10:47:01,068 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-20 10:47:01,068 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:47:01,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:01,180 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-20 10:47:01,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-11-20 10:47:01,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:01,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:01,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:01,183 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:01,231 INFO L567 ElimStorePlain]: treesize reduction 138, result has 28.1 percent of original size [2019-11-20 10:47:01,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:01,232 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-20 10:47:01,235 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_189|], 12=[|v_#memory_$Pointer$.base_200|]} [2019-11-20 10:47:01,237 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:47:01,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:01,303 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-20 10:47:01,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-20 10:47:01,304 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:01,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:01,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:01,314 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-20 10:47:01,322 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_164|], 12=[|v_#memory_$Pointer$.base_201|]} [2019-11-20 10:47:01,325 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-20 10:47:01,325 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:47:01,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:01,459 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-20 10:47:01,459 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-20 10:47:01,460 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-11-20 10:47:01,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:47:01,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:01,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:01,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:01,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:01,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:01,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:01,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:01,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:01,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:01,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:01,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:01,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:01,466 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-20 10:47:01,531 INFO L567 ElimStorePlain]: treesize reduction 618, result has 8.0 percent of original size [2019-11-20 10:47:01,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:01,531 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-20 10:47:01,540 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_182|], 2=[|v_#memory_$Pointer$.offset_162|, |v_#memory_$Pointer$.base_191|, |v_#memory_$Pointer$.offset_161|], 6=[|v_#memory_$Pointer$.base_190|], 12=[|v_#memory_$Pointer$.base_202|]} [2019-11-20 10:47:01,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,552 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-11-20 10:47:01,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:01,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:01,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,618 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-11-20 10:47:01,618 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:01,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:01,663 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:47:01,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:01,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,715 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 116 treesize of output 88 [2019-11-20 10:47:01,715 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:01,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:01,752 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:47:01,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:01,791 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 162 [2019-11-20 10:47:01,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,809 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 137 treesize of output 119 [2019-11-20 10:47:01,810 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:01,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:01,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:01,953 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-11-20 10:47:01,954 INFO L343 Elim1Store]: treesize reduction 152, result has 48.3 percent of original size [2019-11-20 10:47:01,954 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 158 treesize of output 179 [2019-11-20 10:47:01,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:01,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:01,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:01,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:47:01,956 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:01,991 INFO L567 ElimStorePlain]: treesize reduction 48, result has 68.4 percent of original size [2019-11-20 10:47:01,991 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:02,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:02,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:02,016 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:317, output treesize:92 [2019-11-20 10:47:02,053 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_165|], 6=[|v_#memory_$Pointer$.base_203|], 12=[|v_#memory_int_183|]} [2019-11-20 10:47:02,057 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 53 treesize of output 41 [2019-11-20 10:47:02,058 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:47:02,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:02,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:02,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:02,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:02,094 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 45 [2019-11-20 10:47:02,095 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:47:02,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:02,136 INFO L343 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2019-11-20 10:47:02,137 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 10:47:02,137 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:02,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:02,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 10:47:02,153 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:123, output treesize:32 [2019-11-20 10:47:02,650 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 10:47:02,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:47:02,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-20 10:47:02,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061594314] [2019-11-20 10:47:02,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:47:02,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:47:02,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:47:02,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:47:02,655 INFO L87 Difference]: Start difference. First operand 2054 states and 3168 transitions. Second operand 10 states. [2019-11-20 10:47:05,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:47:05,198 INFO L93 Difference]: Finished difference Result 5566 states and 8520 transitions. [2019-11-20 10:47:05,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 10:47:05,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2019-11-20 10:47:05,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:47:05,201 INFO L225 Difference]: With dead ends: 5566 [2019-11-20 10:47:05,202 INFO L226 Difference]: Without dead ends: 3531 [2019-11-20 10:47:05,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-11-20 10:47:05,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3531 states. [2019-11-20 10:47:05,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3531 to 2366. [2019-11-20 10:47:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2366 states. [2019-11-20 10:47:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3720 transitions. [2019-11-20 10:47:05,299 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3720 transitions. Word has length 191 [2019-11-20 10:47:05,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:47:05,300 INFO L462 AbstractCegarLoop]: Abstraction has 2366 states and 3720 transitions. [2019-11-20 10:47:05,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:47:05,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3720 transitions. [2019-11-20 10:47:05,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-20 10:47:05,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:47:05,302 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, 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-11-20 10:47:05,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:47:05,502 INFO L410 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:47:05,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:47:05,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1233344752, now seen corresponding path program 1 times [2019-11-20 10:47:05,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:47:05,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342773071] [2019-11-20 10:47:05,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:47:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:47:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:47:05,781 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:47:05,781 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 10:47:05,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:47:05 BoogieIcfgContainer [2019-11-20 10:47:05,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 10:47:05,955 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 10:47:05,955 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 10:47:05,956 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 10:47:05,956 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:45:38" (3/4) ... [2019-11-20 10:47:05,959 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 10:47:05,959 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 10:47:05,961 INFO L168 Benchmark]: Toolchain (without parser) took 89887.99 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 946.1 MB in the beginning and 1.3 GB in the end (delta: -389.4 MB). Peak memory consumption was 633.5 MB. Max. memory is 11.5 GB. [2019-11-20 10:47:05,961 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:47:05,962 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 946.1 MB in the beginning and 1.2 GB in the end (delta: -226.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-20 10:47:05,962 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:47:05,963 INFO L168 Benchmark]: Boogie Preprocessor took 119.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:47:05,964 INFO L168 Benchmark]: RCFGBuilder took 1180.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:47:05,964 INFO L168 Benchmark]: TraceAbstraction took 87687.86 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 821.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -271.1 MB). Peak memory consumption was 550.5 MB. Max. memory is 11.5 GB. [2019-11-20 10:47:05,964 INFO L168 Benchmark]: Witness Printer took 4.37 ms. Allocated memory is still 2.1 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:47:05,966 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 789.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 946.1 MB in the beginning and 1.2 GB in the end (delta: -226.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 119.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1180.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 87687.86 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 821.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -271.1 MB). Peak memory consumption was 550.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.37 ms. Allocated memory is still 2.1 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1750]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={6:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={6:0}] [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) VAL [init=1, SSLv3_server_data={6:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={6:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={6:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={6:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1229] COND TRUE s->state == 8656 [L1594] EXPR s->session [L1594] EXPR s->s3 [L1594] EXPR (s->s3)->tmp.new_cipher [L1594] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1595] COND FALSE !(! tmp___9) [L1601] ret = __VERIFIER_nondet_int() [L1602] COND FALSE !(blastFlag == 10) VAL [init=1, SSLv3_server_data={6:0}] [L1605] COND FALSE !(blastFlag == 13) VAL [init=1, SSLv3_server_data={6:0}] [L1611] COND FALSE !(ret <= 0) [L1616] s->state = 8672 [L1617] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1618] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={6:0}] [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1235] COND TRUE s->state == 8672 [L1627] ret = __VERIFIER_nondet_int() [L1628] COND FALSE !(blastFlag == 11) VAL [init=1, SSLv3_server_data={6:0}] [L1631] COND FALSE !(blastFlag == 14) VAL [init=1, SSLv3_server_data={6:0}] [L1637] COND FALSE !(ret <= 0) [L1642] s->state = 8448 [L1643] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1643] COND TRUE s->hit [L1644] EXPR s->s3 [L1644] (s->s3)->tmp.next_state = 8640 [L1648] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={6:0}] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) VAL [init=1, SSLv3_server_data={6:0}] [L1574] COND FALSE !(blastFlag == 12) VAL [init=1, SSLv3_server_data={6:0}] [L1750] __VERIFIER_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 153 locations, 1 error locations. Result: UNSAFE, OverallTime: 87.6s, OverallIterations: 120, TraceHistogramMax: 7, AutomataDifference: 54.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 27242 SDtfs, 9977 SDslu, 43276 SDs, 0 SdLazy, 28109 SolverSat, 1493 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 41.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1236 GetRequests, 755 SyntacticMatches, 91 SemanticMatches, 390 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2366occurred in iteration=119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 119 MinimizatonAttempts, 10685 StatesRemovedByMinimization, 119 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 22.5s InterpolantComputationTime, 15247 NumberOfCodeBlocks, 15247 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 14929 ConstructedInterpolants, 110 QuantifiedInterpolants, 9939998 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1999 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 122 InterpolantComputations, 117 PerfectInterpolantSequences, 16265/17043 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... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 10:47:08,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:47:08,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:47:08,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:47:08,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:47:08,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:47:08,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:47:08,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:47:08,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:47:08,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:47:08,114 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:47:08,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:47:08,116 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:47:08,122 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:47:08,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:47:08,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:47:08,128 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:47:08,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:47:08,132 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:47:08,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:47:08,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:47:08,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:47:08,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:47:08,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:47:08,142 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:47:08,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:47:08,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:47:08,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:47:08,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:47:08,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:47:08,146 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:47:08,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:47:08,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:47:08,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:47:08,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:47:08,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:47:08,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:47:08,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:47:08,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:47:08,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:47:08,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:47:08,153 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 10:47:08,187 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:47:08,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:47:08,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:47:08,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:47:08,189 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:47:08,190 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:47:08,190 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:47:08,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:47:08,191 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:47:08,191 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:47:08,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:47:08,191 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:47:08,192 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 10:47:08,192 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 10:47:08,192 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:47:08,193 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:47:08,193 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:47:08,193 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:47:08,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:47:08,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:47:08,194 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:47:08,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:47:08,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:47:08,195 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:47:08,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:47:08,196 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:47:08,196 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 10:47:08,196 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 10:47:08,197 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:47:08,197 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 10:47:08,197 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_020a20bd-894a-4328-b16b-2587c61f81a2/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 -> 8ae4fea535defe079744031ef9589bd179b2820b [2019-11-20 10:47:08,535 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:47:08,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:47:08,547 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:47:08,548 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:47:08,548 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:47:08,554 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-2.c [2019-11-20 10:47:08,613 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/data/5203d2241/68b45ec3ba1e401c8bf5742fd8fe40b5/FLAG25e071804 [2019-11-20 10:47:09,234 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:47:09,234 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-2.c [2019-11-20 10:47:09,257 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/data/5203d2241/68b45ec3ba1e401c8bf5742fd8fe40b5/FLAG25e071804 [2019-11-20 10:47:09,427 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/data/5203d2241/68b45ec3ba1e401c8bf5742fd8fe40b5 [2019-11-20 10:47:09,429 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:47:09,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:47:09,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:47:09,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:47:09,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:47:09,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:47:09" (1/1) ... [2019-11-20 10:47:09,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551ff55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:09, skipping insertion in model container [2019-11-20 10:47:09,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:47:09" (1/1) ... [2019-11-20 10:47:09,447 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:47:09,507 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:47:10,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:47:10,191 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:47:10,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:47:10,406 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:47:10,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:10 WrapperNode [2019-11-20 10:47:10,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:47:10,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:47:10,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:47:10,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:47:10,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:10" (1/1) ... [2019-11-20 10:47:10,483 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:10" (1/1) ... [2019-11-20 10:47:10,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:47:10,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:47:10,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:47:10,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:47:10,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:10" (1/1) ... [2019-11-20 10:47:10,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:10" (1/1) ... [2019-11-20 10:47:10,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:10" (1/1) ... [2019-11-20 10:47:10,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:10" (1/1) ... [2019-11-20 10:47:10,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:10" (1/1) ... [2019-11-20 10:47:10,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:10" (1/1) ... [2019-11-20 10:47:10,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:10" (1/1) ... [2019-11-20 10:47:10,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:47:10,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:47:10,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:47:10,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:47:10,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:47:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 10:47:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 10:47:10,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 10:47:10,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 10:47:10,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 10:47:10,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:47:10,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:47:10,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 10:47:11,031 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 10:47:13,728 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 10:47:13,728 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 10:47:13,729 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:47:13,734 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 10:47:13,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:47:13 BoogieIcfgContainer [2019-11-20 10:47:13,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:47:13,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:47:13,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:47:13,743 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:47:13,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:47:09" (1/3) ... [2019-11-20 10:47:13,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b3245c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:47:13, skipping insertion in model container [2019-11-20 10:47:13,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:10" (2/3) ... [2019-11-20 10:47:13,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b3245c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:47:13, skipping insertion in model container [2019-11-20 10:47:13,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:47:13" (3/3) ... [2019-11-20 10:47:13,750 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14.i.cil-2.c [2019-11-20 10:47:13,760 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:47:13,769 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 10:47:13,782 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 10:47:13,819 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:47:13,820 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 10:47:13,820 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:47:13,820 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:47:13,820 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:47:13,821 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:47:13,821 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:47:13,821 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:47:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2019-11-20 10:47:13,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 10:47:13,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:47:13,868 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:47:13,868 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:47:13,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:47:13,875 INFO L82 PathProgramCache]: Analyzing trace with hash 557484008, now seen corresponding path program 1 times [2019-11-20 10:47:13,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:47:13,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1420063742] [2019-11-20 10:47:13,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:47:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:47:14,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:47:14,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:47:14,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:14,394 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:47:14,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:14,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:14,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:14,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:47:14,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:14,476 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:14,477 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:47:14,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:14,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:14,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:14,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:47:14,518 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:47:14,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:14,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:14,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:14,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:47:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:47:14,561 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:47:14,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:47:14,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1420063742] [2019-11-20 10:47:14,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:47:14,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:47:14,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119644885] [2019-11-20 10:47:14,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:47:14,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:47:14,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:47:14,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:47:14,662 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 6 states. [2019-11-20 10:47:22,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:47:22,512 INFO L93 Difference]: Finished difference Result 548 states and 938 transitions. [2019-11-20 10:47:22,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:47:22,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-20 10:47:22,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:47:22,533 INFO L225 Difference]: With dead ends: 548 [2019-11-20 10:47:22,533 INFO L226 Difference]: Without dead ends: 365 [2019-11-20 10:47:22,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:47:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-20 10:47:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 180. [2019-11-20 10:47:22,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-20 10:47:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 290 transitions. [2019-11-20 10:47:22,609 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 290 transitions. Word has length 42 [2019-11-20 10:47:22,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:47:22,610 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 290 transitions. [2019-11-20 10:47:22,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:47:22,610 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 290 transitions. [2019-11-20 10:47:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 10:47:22,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:47:22,614 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-11-20 10:47:22,817 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:47:22,817 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:47:22,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:47:22,818 INFO L82 PathProgramCache]: Analyzing trace with hash -139061238, now seen corresponding path program 1 times [2019-11-20 10:47:22,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:47:22,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1306679788] [2019-11-20 10:47:22,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:47:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:47:23,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:47:23,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:47:23,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:23,124 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:47:23,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:23,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:23,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:23,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:47:23,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:23,226 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:23,229 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:47:23,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:23,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:23,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:23,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:47:23,264 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:47:23,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:23,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:23,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:23,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:47:23,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:47:23,294 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:47:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:47:23,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1306679788] [2019-11-20 10:47:23,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:47:23,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:47:23,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344316067] [2019-11-20 10:47:23,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:47:23,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:47:23,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:47:23,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:47:23,351 INFO L87 Difference]: Start difference. First operand 180 states and 290 transitions. Second operand 6 states. [2019-11-20 10:47:31,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:47:31,963 INFO L93 Difference]: Finished difference Result 569 states and 911 transitions. [2019-11-20 10:47:31,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:47:31,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-11-20 10:47:31,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:47:31,970 INFO L225 Difference]: With dead ends: 569 [2019-11-20 10:47:31,970 INFO L226 Difference]: Without dead ends: 397 [2019-11-20 10:47:31,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:47:31,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-20 10:47:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 220. [2019-11-20 10:47:31,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-20 10:47:31,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 364 transitions. [2019-11-20 10:47:31,996 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 364 transitions. Word has length 43 [2019-11-20 10:47:31,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:47:31,997 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 364 transitions. [2019-11-20 10:47:31,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:47:31,997 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 364 transitions. [2019-11-20 10:47:32,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 10:47:32,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:47:32,002 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 10:47:32,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:47:32,206 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:47:32,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:47:32,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1400197659, now seen corresponding path program 1 times [2019-11-20 10:47:32,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:47:32,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2050176761] [2019-11-20 10:47:32,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:47:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:47:32,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:47:32,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:47:32,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:32,719 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:47:32,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:32,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:32,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:32,740 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:47:32,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:32,783 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:32,783 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:47:32,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:32,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:32,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:32,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:47:32,807 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:47:32,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:32,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:32,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:32,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:47:32,839 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:47:32,839 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:47:32,917 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:47:32,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2050176761] [2019-11-20 10:47:32,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:47:32,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:47:32,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248344949] [2019-11-20 10:47:32,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:47:32,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:47:32,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:47:32,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:47:32,922 INFO L87 Difference]: Start difference. First operand 220 states and 364 transitions. Second operand 6 states. [2019-11-20 10:47:39,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:47:39,539 INFO L93 Difference]: Finished difference Result 682 states and 1121 transitions. [2019-11-20 10:47:39,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:47:39,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-11-20 10:47:39,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:47:39,544 INFO L225 Difference]: With dead ends: 682 [2019-11-20 10:47:39,544 INFO L226 Difference]: Without dead ends: 470 [2019-11-20 10:47:39,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:47:39,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-11-20 10:47:39,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 284. [2019-11-20 10:47:39,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-20 10:47:39,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 480 transitions. [2019-11-20 10:47:39,570 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 480 transitions. Word has length 71 [2019-11-20 10:47:39,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:47:39,571 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 480 transitions. [2019-11-20 10:47:39,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:47:39,571 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 480 transitions. [2019-11-20 10:47:39,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 10:47:39,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:47:39,577 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:47:39,781 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:47:39,781 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:47:39,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:47:39,781 INFO L82 PathProgramCache]: Analyzing trace with hash 658627804, now seen corresponding path program 1 times [2019-11-20 10:47:39,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:47:39,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [353059739] [2019-11-20 10:47:39,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:47:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:47:39,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:47:39,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:47:39,988 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:47:39,988 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:47:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:47:40,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [353059739] [2019-11-20 10:47:40,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:47:40,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 10:47:40,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804379325] [2019-11-20 10:47:40,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:47:40,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:47:40,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:47:40,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:47:40,011 INFO L87 Difference]: Start difference. First operand 284 states and 480 transitions. Second operand 3 states. [2019-11-20 10:47:40,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:47:40,409 INFO L93 Difference]: Finished difference Result 830 states and 1411 transitions. [2019-11-20 10:47:40,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:47:40,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-20 10:47:40,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:47:40,414 INFO L225 Difference]: With dead ends: 830 [2019-11-20 10:47:40,414 INFO L226 Difference]: Without dead ends: 554 [2019-11-20 10:47:40,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:47:40,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-11-20 10:47:40,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2019-11-20 10:47:40,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-11-20 10:47:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 928 transitions. [2019-11-20 10:47:40,445 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 928 transitions. Word has length 77 [2019-11-20 10:47:40,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:47:40,446 INFO L462 AbstractCegarLoop]: Abstraction has 554 states and 928 transitions. [2019-11-20 10:47:40,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:47:40,446 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 928 transitions. [2019-11-20 10:47:40,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 10:47:40,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:47:40,459 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:47:40,660 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:47:40,661 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:47:40,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:47:40,661 INFO L82 PathProgramCache]: Analyzing trace with hash -713179494, now seen corresponding path program 1 times [2019-11-20 10:47:40,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:47:40,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1124695918] [2019-11-20 10:47:40,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:47:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:47:41,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:47:41,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:47:41,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:41,094 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:47:41,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:41,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:41,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:41,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:47:41,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:41,134 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:41,135 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:47:41,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:41,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:41,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:41,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:47:41,186 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:47:41,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:41,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:41,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:41,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:47:41,221 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:47:41,221 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:47:41,279 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:47:41,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1124695918] [2019-11-20 10:47:41,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:47:41,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:47:41,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992351721] [2019-11-20 10:47:41,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:47:41,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:47:41,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:47:41,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:47:41,281 INFO L87 Difference]: Start difference. First operand 554 states and 928 transitions. Second operand 6 states. [2019-11-20 10:47:47,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:47:47,037 INFO L93 Difference]: Finished difference Result 1433 states and 2352 transitions. [2019-11-20 10:47:47,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:47:47,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-11-20 10:47:47,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:47:47,044 INFO L225 Difference]: With dead ends: 1433 [2019-11-20 10:47:47,044 INFO L226 Difference]: Without dead ends: 887 [2019-11-20 10:47:47,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:47:47,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2019-11-20 10:47:47,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 628. [2019-11-20 10:47:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-11-20 10:47:47,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1060 transitions. [2019-11-20 10:47:47,068 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 1060 transitions. Word has length 77 [2019-11-20 10:47:47,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:47:47,068 INFO L462 AbstractCegarLoop]: Abstraction has 628 states and 1060 transitions. [2019-11-20 10:47:47,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:47:47,069 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 1060 transitions. [2019-11-20 10:47:47,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-20 10:47:47,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:47:47,071 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:47:47,275 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:47:47,275 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:47:47,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:47:47,276 INFO L82 PathProgramCache]: Analyzing trace with hash -494460968, now seen corresponding path program 1 times [2019-11-20 10:47:47,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:47:47,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1285161607] [2019-11-20 10:47:47,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:47:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:47:47,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:47:47,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:47:47,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:47,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:47:47,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:47,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:47,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:47,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:47:47,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:47,848 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:47,849 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:47:47,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:47,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:47,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:47,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:47:47,872 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:47:47,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:47,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:47,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:47,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:47:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:47:47,902 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:47:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:47:47,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1285161607] [2019-11-20 10:47:47,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:47:47,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:47:47,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629240887] [2019-11-20 10:47:47,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:47:47,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:47:47,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:47:47,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:47:47,946 INFO L87 Difference]: Start difference. First operand 628 states and 1060 transitions. Second operand 6 states. [2019-11-20 10:47:55,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:47:55,871 INFO L93 Difference]: Finished difference Result 1497 states and 2466 transitions. [2019-11-20 10:47:55,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:47:55,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-11-20 10:47:55,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:47:55,887 INFO L225 Difference]: With dead ends: 1497 [2019-11-20 10:47:55,888 INFO L226 Difference]: Without dead ends: 877 [2019-11-20 10:47:55,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:47:55,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-11-20 10:47:55,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 628. [2019-11-20 10:47:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-11-20 10:47:55,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1056 transitions. [2019-11-20 10:47:55,913 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 1056 transitions. Word has length 78 [2019-11-20 10:47:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:47:55,915 INFO L462 AbstractCegarLoop]: Abstraction has 628 states and 1056 transitions. [2019-11-20 10:47:55,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:47:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 1056 transitions. [2019-11-20 10:47:55,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 10:47:55,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:47:55,918 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:47:56,121 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:47:56,122 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:47:56,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:47:56,122 INFO L82 PathProgramCache]: Analyzing trace with hash 747069293, now seen corresponding path program 1 times [2019-11-20 10:47:56,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:47:56,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1246626099] [2019-11-20 10:47:56,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:47:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:47:56,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:47:56,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:47:56,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:56,587 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:47:56,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:56,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:56,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:56,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:47:56,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:47:56,618 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:56,618 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:47:56,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:56,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:56,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:56,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:47:56,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:47:56,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:47:56,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:47:56,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:47:56,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:47:56,656 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:47:56,656 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:47:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:47:56,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1246626099] [2019-11-20 10:47:56,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:47:56,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:47:56,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293133408] [2019-11-20 10:47:56,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:47:56,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:47:56,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:47:56,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:47:56,695 INFO L87 Difference]: Start difference. First operand 628 states and 1056 transitions. Second operand 6 states. [2019-11-20 10:48:05,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:48:05,399 INFO L93 Difference]: Finished difference Result 1577 states and 2597 transitions. [2019-11-20 10:48:05,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:48:05,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-11-20 10:48:05,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:48:05,408 INFO L225 Difference]: With dead ends: 1577 [2019-11-20 10:48:05,408 INFO L226 Difference]: Without dead ends: 957 [2019-11-20 10:48:05,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:48:05,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2019-11-20 10:48:05,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 660. [2019-11-20 10:48:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-11-20 10:48:05,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1100 transitions. [2019-11-20 10:48:05,434 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1100 transitions. Word has length 84 [2019-11-20 10:48:05,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:48:05,435 INFO L462 AbstractCegarLoop]: Abstraction has 660 states and 1100 transitions. [2019-11-20 10:48:05,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:48:05,435 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1100 transitions. [2019-11-20 10:48:05,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 10:48:05,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:48:05,437 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:48:05,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:48:05,641 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:48:05,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:48:05,642 INFO L82 PathProgramCache]: Analyzing trace with hash 788787370, now seen corresponding path program 1 times [2019-11-20 10:48:05,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:48:05,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1946759427] [2019-11-20 10:48:05,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:48:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:06,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:48:06,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:48:06,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:48:06,078 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:48:06,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:06,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:06,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:06,094 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:48:06,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:48:06,109 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:06,110 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:48:06,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:06,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:06,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:06,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:48:06,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:48:06,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:06,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:06,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:06,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:48:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:48:06,140 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:48:06,181 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:48:06,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1946759427] [2019-11-20 10:48:06,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:48:06,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:48:06,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387618708] [2019-11-20 10:48:06,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:48:06,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:48:06,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:48:06,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:48:06,183 INFO L87 Difference]: Start difference. First operand 660 states and 1100 transitions. Second operand 6 states. [2019-11-20 10:48:15,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:48:15,930 INFO L93 Difference]: Finished difference Result 1559 states and 2542 transitions. [2019-11-20 10:48:15,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:48:15,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-11-20 10:48:15,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:48:15,937 INFO L225 Difference]: With dead ends: 1559 [2019-11-20 10:48:15,938 INFO L226 Difference]: Without dead ends: 907 [2019-11-20 10:48:15,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:48:15,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2019-11-20 10:48:15,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 660. [2019-11-20 10:48:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-11-20 10:48:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1090 transitions. [2019-11-20 10:48:15,962 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1090 transitions. Word has length 85 [2019-11-20 10:48:15,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:48:15,963 INFO L462 AbstractCegarLoop]: Abstraction has 660 states and 1090 transitions. [2019-11-20 10:48:15,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:48:15,963 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1090 transitions. [2019-11-20 10:48:15,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 10:48:15,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:48:15,965 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:48:16,168 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:48:16,169 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:48:16,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:48:16,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2013894360, now seen corresponding path program 1 times [2019-11-20 10:48:16,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:48:16,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [433295038] [2019-11-20 10:48:16,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:48:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:16,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:48:16,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:48:16,338 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:48:16,338 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:48:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:48:16,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [433295038] [2019-11-20 10:48:16,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:48:16,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 10:48:16,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622087916] [2019-11-20 10:48:16,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:48:16,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:48:16,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:48:16,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:48:16,352 INFO L87 Difference]: Start difference. First operand 660 states and 1090 transitions. Second operand 3 states. [2019-11-20 10:48:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:48:16,887 INFO L93 Difference]: Finished difference Result 1636 states and 2714 transitions. [2019-11-20 10:48:16,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:48:16,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-20 10:48:16,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:48:16,894 INFO L225 Difference]: With dead ends: 1636 [2019-11-20 10:48:16,894 INFO L226 Difference]: Without dead ends: 984 [2019-11-20 10:48:16,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:48:16,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-11-20 10:48:16,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 984. [2019-11-20 10:48:16,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-11-20 10:48:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1620 transitions. [2019-11-20 10:48:16,925 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1620 transitions. Word has length 85 [2019-11-20 10:48:16,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:48:16,925 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1620 transitions. [2019-11-20 10:48:16,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:48:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1620 transitions. [2019-11-20 10:48:16,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 10:48:16,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:48:16,928 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:48:17,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:48:17,130 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:48:17,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:48:17,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1701406032, now seen corresponding path program 1 times [2019-11-20 10:48:17,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:48:17,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1019099211] [2019-11-20 10:48:17,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:48:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:17,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:48:17,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:48:17,328 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:48:17,328 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:48:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:48:17,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1019099211] [2019-11-20 10:48:17,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:48:17,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 10:48:17,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914036125] [2019-11-20 10:48:17,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:48:17,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:48:17,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:48:17,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:48:17,344 INFO L87 Difference]: Start difference. First operand 984 states and 1620 transitions. Second operand 4 states. [2019-11-20 10:48:17,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:48:17,488 INFO L93 Difference]: Finished difference Result 2575 states and 4258 transitions. [2019-11-20 10:48:17,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:48:17,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-20 10:48:17,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:48:17,497 INFO L225 Difference]: With dead ends: 2575 [2019-11-20 10:48:17,498 INFO L226 Difference]: Without dead ends: 1599 [2019-11-20 10:48:17,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:48:17,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2019-11-20 10:48:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1592. [2019-11-20 10:48:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1592 states. [2019-11-20 10:48:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2626 transitions. [2019-11-20 10:48:17,547 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2626 transitions. Word has length 86 [2019-11-20 10:48:17,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:48:17,547 INFO L462 AbstractCegarLoop]: Abstraction has 1592 states and 2626 transitions. [2019-11-20 10:48:17,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:48:17,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2626 transitions. [2019-11-20 10:48:17,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 10:48:17,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:48:17,550 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:48:17,753 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:48:17,753 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:48:17,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:48:17,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1453259538, now seen corresponding path program 1 times [2019-11-20 10:48:17,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:48:17,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [149111352] [2019-11-20 10:48:17,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:48:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:18,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:48:18,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:48:18,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:48:18,154 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:48:18,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:18,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:18,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:18,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:48:18,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:48:18,179 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:18,179 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:48:18,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:18,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:18,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:18,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:48:18,197 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:48:18,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:18,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:18,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:18,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:48:18,259 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:48:18,259 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:48:18,311 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:48:18,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [149111352] [2019-11-20 10:48:18,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:48:18,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:48:18,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527314897] [2019-11-20 10:48:18,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:48:18,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:48:18,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:48:18,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:48:18,314 INFO L87 Difference]: Start difference. First operand 1592 states and 2626 transitions. Second operand 6 states. [2019-11-20 10:48:23,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:48:23,455 INFO L93 Difference]: Finished difference Result 3855 states and 6236 transitions. [2019-11-20 10:48:23,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:48:23,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-11-20 10:48:23,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:48:23,468 INFO L225 Difference]: With dead ends: 3855 [2019-11-20 10:48:23,469 INFO L226 Difference]: Without dead ends: 2271 [2019-11-20 10:48:23,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:48:23,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states. [2019-11-20 10:48:23,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 1807. [2019-11-20 10:48:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1807 states. [2019-11-20 10:48:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2991 transitions. [2019-11-20 10:48:23,526 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2991 transitions. Word has length 86 [2019-11-20 10:48:23,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:48:23,526 INFO L462 AbstractCegarLoop]: Abstraction has 1807 states and 2991 transitions. [2019-11-20 10:48:23,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:48:23,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2991 transitions. [2019-11-20 10:48:23,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 10:48:23,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:48:23,529 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:48:23,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:48:23,733 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:48:23,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:48:23,734 INFO L82 PathProgramCache]: Analyzing trace with hash -84942000, now seen corresponding path program 1 times [2019-11-20 10:48:23,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:48:23,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [762075276] [2019-11-20 10:48:23,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:48:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:24,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:48:24,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:48:24,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:48:24,176 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:48:24,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:24,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:24,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:24,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:48:24,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:48:24,199 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:24,199 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:48:24,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:24,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:24,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:24,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:48:24,215 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:48:24,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:24,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:24,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:24,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:48:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:48:24,235 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:48:24,272 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:48:24,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [762075276] [2019-11-20 10:48:24,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:48:24,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:48:24,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764058029] [2019-11-20 10:48:24,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:48:24,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:48:24,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:48:24,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:48:24,273 INFO L87 Difference]: Start difference. First operand 1807 states and 2991 transitions. Second operand 6 states. [2019-11-20 10:48:29,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:48:29,558 INFO L93 Difference]: Finished difference Result 4081 states and 6621 transitions. [2019-11-20 10:48:29,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:48:29,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-11-20 10:48:29,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:48:29,572 INFO L225 Difference]: With dead ends: 4081 [2019-11-20 10:48:29,573 INFO L226 Difference]: Without dead ends: 2270 [2019-11-20 10:48:29,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:48:29,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2019-11-20 10:48:29,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 1817. [2019-11-20 10:48:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1817 states. [2019-11-20 10:48:29,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 3006 transitions. [2019-11-20 10:48:29,633 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 3006 transitions. Word has length 87 [2019-11-20 10:48:29,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:48:29,633 INFO L462 AbstractCegarLoop]: Abstraction has 1817 states and 3006 transitions. [2019-11-20 10:48:29,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:48:29,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 3006 transitions. [2019-11-20 10:48:29,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 10:48:29,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:48:29,637 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:48:29,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:48:29,841 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:48:29,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:48:29,841 INFO L82 PathProgramCache]: Analyzing trace with hash -413108077, now seen corresponding path program 1 times [2019-11-20 10:48:29,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:48:29,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [681472414] [2019-11-20 10:48:29,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:48:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:30,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:48:30,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:48:30,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:48:30,409 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:48:30,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:30,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:30,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:30,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:48:30,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:48:30,448 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:30,449 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:48:30,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:30,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:30,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:30,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:48:30,462 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:48:30,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:30,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:30,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:30,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:48:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 10:48:30,476 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:48:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 10:48:30,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [681472414] [2019-11-20 10:48:30,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:48:30,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:48:30,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048114342] [2019-11-20 10:48:30,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:48:30,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:48:30,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:48:30,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:48:30,532 INFO L87 Difference]: Start difference. First operand 1817 states and 3006 transitions. Second operand 6 states. [2019-11-20 10:48:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:48:35,839 INFO L93 Difference]: Finished difference Result 4073 states and 6607 transitions. [2019-11-20 10:48:35,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:48:35,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-20 10:48:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:48:35,851 INFO L225 Difference]: With dead ends: 4073 [2019-11-20 10:48:35,851 INFO L226 Difference]: Without dead ends: 2264 [2019-11-20 10:48:35,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:48:35,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2019-11-20 10:48:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 1817. [2019-11-20 10:48:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1817 states. [2019-11-20 10:48:35,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2972 transitions. [2019-11-20 10:48:35,912 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2972 transitions. Word has length 98 [2019-11-20 10:48:35,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:48:35,912 INFO L462 AbstractCegarLoop]: Abstraction has 1817 states and 2972 transitions. [2019-11-20 10:48:35,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:48:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2972 transitions. [2019-11-20 10:48:35,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 10:48:35,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:48:35,916 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:48:36,121 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:48:36,121 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:48:36,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:48:36,122 INFO L82 PathProgramCache]: Analyzing trace with hash -437693078, now seen corresponding path program 1 times [2019-11-20 10:48:36,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:48:36,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1846669102] [2019-11-20 10:48:36,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:48:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:36,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:48:36,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:48:36,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:48:36,627 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:48:36,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:36,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:36,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:36,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:48:36,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:48:36,652 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:36,652 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:48:36,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:36,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:36,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:36,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:48:36,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:48:36,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:36,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:36,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:36,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:48:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:48:36,690 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:48:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:48:36,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1846669102] [2019-11-20 10:48:36,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:48:36,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:48:36,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828249809] [2019-11-20 10:48:36,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:48:36,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:48:36,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:48:36,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:48:36,728 INFO L87 Difference]: Start difference. First operand 1817 states and 2972 transitions. Second operand 6 states. [2019-11-20 10:48:44,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:48:44,334 INFO L93 Difference]: Finished difference Result 4283 states and 6888 transitions. [2019-11-20 10:48:44,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:48:44,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-20 10:48:44,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:48:44,345 INFO L225 Difference]: With dead ends: 4283 [2019-11-20 10:48:44,345 INFO L226 Difference]: Without dead ends: 2474 [2019-11-20 10:48:44,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:48:44,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2019-11-20 10:48:44,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 1967. [2019-11-20 10:48:44,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-11-20 10:48:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3203 transitions. [2019-11-20 10:48:44,407 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3203 transitions. Word has length 98 [2019-11-20 10:48:44,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:48:44,408 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 3203 transitions. [2019-11-20 10:48:44,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:48:44,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3203 transitions. [2019-11-20 10:48:44,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 10:48:44,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:48:44,411 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:48:44,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:48:44,615 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:48:44,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:48:44,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1760744063, now seen corresponding path program 1 times [2019-11-20 10:48:44,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:48:44,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1624285498] [2019-11-20 10:48:44,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:48:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:45,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:48:45,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:48:45,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:48:45,128 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:48:45,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:45,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:45,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:45,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:48:45,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:48:45,154 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:45,154 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:48:45,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:45,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:45,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:45,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:48:45,169 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:48:45,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:45,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:45,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:45,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:48:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 10:48:45,183 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:48:45,215 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 10:48:45,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1624285498] [2019-11-20 10:48:45,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:48:45,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:48:45,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004666887] [2019-11-20 10:48:45,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:48:45,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:48:45,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:48:45,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:48:45,217 INFO L87 Difference]: Start difference. First operand 1967 states and 3203 transitions. Second operand 6 states. [2019-11-20 10:48:50,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:48:50,955 INFO L93 Difference]: Finished difference Result 4373 states and 6999 transitions. [2019-11-20 10:48:50,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:48:50,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-20 10:48:50,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:48:50,965 INFO L225 Difference]: With dead ends: 4373 [2019-11-20 10:48:50,965 INFO L226 Difference]: Without dead ends: 2414 [2019-11-20 10:48:50,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:48:50,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-11-20 10:48:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 1967. [2019-11-20 10:48:51,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-11-20 10:48:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3164 transitions. [2019-11-20 10:48:51,068 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3164 transitions. Word has length 98 [2019-11-20 10:48:51,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:48:51,069 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 3164 transitions. [2019-11-20 10:48:51,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:48:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3164 transitions. [2019-11-20 10:48:51,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 10:48:51,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:48:51,073 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:48:51,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:48:51,281 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:48:51,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:48:51,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1904126404, now seen corresponding path program 1 times [2019-11-20 10:48:51,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:48:51,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1601588705] [2019-11-20 10:48:51,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:48:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:51,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:48:51,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:48:51,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:48:51,780 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:48:51,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:51,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:51,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:51,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:48:51,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:48:51,804 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:51,805 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:48:51,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:51,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:51,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:51,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:48:51,822 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:48:51,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:51,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:51,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:51,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:48:51,841 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 10:48:51,841 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:48:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 10:48:51,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1601588705] [2019-11-20 10:48:51,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:48:51,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:48:51,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992068091] [2019-11-20 10:48:51,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:48:51,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:48:51,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:48:51,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:48:51,876 INFO L87 Difference]: Start difference. First operand 1967 states and 3164 transitions. Second operand 6 states. [2019-11-20 10:48:58,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:48:58,290 INFO L93 Difference]: Finished difference Result 4373 states and 6920 transitions. [2019-11-20 10:48:58,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:48:58,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-20 10:48:58,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:48:58,305 INFO L225 Difference]: With dead ends: 4373 [2019-11-20 10:48:58,305 INFO L226 Difference]: Without dead ends: 2414 [2019-11-20 10:48:58,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:48:58,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-11-20 10:48:58,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 1967. [2019-11-20 10:48:58,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-11-20 10:48:58,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3125 transitions. [2019-11-20 10:48:58,363 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3125 transitions. Word has length 99 [2019-11-20 10:48:58,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:48:58,364 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 3125 transitions. [2019-11-20 10:48:58,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:48:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3125 transitions. [2019-11-20 10:48:58,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 10:48:58,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:48:58,367 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:48:58,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:48:58,573 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:48:58,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:48:58,574 INFO L82 PathProgramCache]: Analyzing trace with hash -407439481, now seen corresponding path program 1 times [2019-11-20 10:48:58,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:48:58,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1836698346] [2019-11-20 10:48:58,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:48:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:48:59,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:48:59,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:48:59,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:48:59,014 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:48:59,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:59,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:59,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:59,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:48:59,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:48:59,052 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:59,052 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:48:59,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:59,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:59,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:59,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:48:59,063 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:48:59,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:48:59,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:48:59,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:48:59,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:48:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:48:59,083 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:48:59,120 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:48:59,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1836698346] [2019-11-20 10:48:59,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:48:59,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:48:59,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123889343] [2019-11-20 10:48:59,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:48:59,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:48:59,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:48:59,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:48:59,121 INFO L87 Difference]: Start difference. First operand 1967 states and 3125 transitions. Second operand 6 states. [2019-11-20 10:49:07,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:49:07,183 INFO L93 Difference]: Finished difference Result 4371 states and 6839 transitions. [2019-11-20 10:49:07,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:49:07,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-20 10:49:07,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:49:07,196 INFO L225 Difference]: With dead ends: 4371 [2019-11-20 10:49:07,197 INFO L226 Difference]: Without dead ends: 2412 [2019-11-20 10:49:07,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:49:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2019-11-20 10:49:07,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 1967. [2019-11-20 10:49:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-11-20 10:49:07,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3096 transitions. [2019-11-20 10:49:07,241 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3096 transitions. Word has length 99 [2019-11-20 10:49:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:49:07,241 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 3096 transitions. [2019-11-20 10:49:07,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:49:07,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3096 transitions. [2019-11-20 10:49:07,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 10:49:07,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:49:07,244 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:49:07,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:49:07,448 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:49:07,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:49:07,449 INFO L82 PathProgramCache]: Analyzing trace with hash 109755514, now seen corresponding path program 1 times [2019-11-20 10:49:07,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:49:07,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [620235460] [2019-11-20 10:49:07,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:49:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:49:07,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:49:07,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:49:07,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:49:07,982 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:49:07,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:49:08,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:08,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:49:08,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:49:08,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:49:08,026 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:08,026 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:49:08,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:49:08,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:08,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:49:08,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:49:08,041 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:49:08,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:49:08,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:08,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:49:08,050 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:49:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 10:49:08,116 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:49:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 10:49:08,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [620235460] [2019-11-20 10:49:08,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:49:08,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:49:08,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504360621] [2019-11-20 10:49:08,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:49:08,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:49:08,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:49:08,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:49:08,182 INFO L87 Difference]: Start difference. First operand 1967 states and 3096 transitions. Second operand 6 states. [2019-11-20 10:49:14,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:49:14,501 INFO L93 Difference]: Finished difference Result 4371 states and 6780 transitions. [2019-11-20 10:49:14,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:49:14,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-11-20 10:49:14,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:49:14,508 INFO L225 Difference]: With dead ends: 4371 [2019-11-20 10:49:14,509 INFO L226 Difference]: Without dead ends: 2412 [2019-11-20 10:49:14,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:49:14,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2019-11-20 10:49:14,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 1967. [2019-11-20 10:49:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-11-20 10:49:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3057 transitions. [2019-11-20 10:49:14,556 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3057 transitions. Word has length 100 [2019-11-20 10:49:14,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:49:14,556 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 3057 transitions. [2019-11-20 10:49:14,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:49:14,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3057 transitions. [2019-11-20 10:49:14,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 10:49:14,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:49:14,558 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:49:14,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:49:14,763 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:49:14,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:49:14,763 INFO L82 PathProgramCache]: Analyzing trace with hash 2071302231, now seen corresponding path program 1 times [2019-11-20 10:49:14,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:49:14,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1961968182] [2019-11-20 10:49:14,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:49:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:49:15,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:49:15,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:49:15,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:49:15,273 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:49:15,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:49:15,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:15,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:49:15,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:49:15,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:49:15,299 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:15,300 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:49:15,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:49:15,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:15,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:49:15,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:49:15,310 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:49:15,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:49:15,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:15,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:49:15,312 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:49:15,325 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 10:49:15,325 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:49:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 10:49:15,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1961968182] [2019-11-20 10:49:15,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:49:15,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:49:15,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482080302] [2019-11-20 10:49:15,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:49:15,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:49:15,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:49:15,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:49:15,377 INFO L87 Difference]: Start difference. First operand 1967 states and 3057 transitions. Second operand 6 states. [2019-11-20 10:49:21,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:49:21,700 INFO L93 Difference]: Finished difference Result 4311 states and 6623 transitions. [2019-11-20 10:49:21,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:49:21,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-11-20 10:49:21,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:49:21,705 INFO L225 Difference]: With dead ends: 4311 [2019-11-20 10:49:21,706 INFO L226 Difference]: Without dead ends: 2352 [2019-11-20 10:49:21,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:49:21,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2019-11-20 10:49:21,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 1967. [2019-11-20 10:49:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-11-20 10:49:21,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3018 transitions. [2019-11-20 10:49:21,752 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3018 transitions. Word has length 101 [2019-11-20 10:49:21,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:49:21,752 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 3018 transitions. [2019-11-20 10:49:21,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:49:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3018 transitions. [2019-11-20 10:49:21,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 10:49:21,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:49:21,754 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:49:21,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:49:21,959 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:49:21,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:49:21,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1741227097, now seen corresponding path program 1 times [2019-11-20 10:49:21,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:49:21,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2067182869] [2019-11-20 10:49:21,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:49:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:49:22,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:49:22,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:49:22,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:49:22,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:49:22,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:49:22,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:22,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:49:22,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:49:22,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:49:22,519 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:22,520 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:49:22,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:49:22,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:22,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:49:22,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:49:22,534 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:49:22,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:49:22,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:22,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:49:22,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:49:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:49:22,554 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:49:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:49:22,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2067182869] [2019-11-20 10:49:22,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:49:22,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:49:22,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902277592] [2019-11-20 10:49:22,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:49:22,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:49:22,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:49:22,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:49:22,598 INFO L87 Difference]: Start difference. First operand 1967 states and 3018 transitions. Second operand 6 states. [2019-11-20 10:49:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:49:29,143 INFO L93 Difference]: Finished difference Result 4521 states and 6864 transitions. [2019-11-20 10:49:29,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:49:29,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-11-20 10:49:29,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:49:29,148 INFO L225 Difference]: With dead ends: 4521 [2019-11-20 10:49:29,148 INFO L226 Difference]: Without dead ends: 2562 [2019-11-20 10:49:29,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:49:29,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2019-11-20 10:49:29,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2107. [2019-11-20 10:49:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2107 states. [2019-11-20 10:49:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 3204 transitions. [2019-11-20 10:49:29,217 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 3204 transitions. Word has length 102 [2019-11-20 10:49:29,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:49:29,218 INFO L462 AbstractCegarLoop]: Abstraction has 2107 states and 3204 transitions. [2019-11-20 10:49:29,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:49:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 3204 transitions. [2019-11-20 10:49:29,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 10:49:29,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:49:29,220 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-11-20 10:49:29,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:49:29,425 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:49:29,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:49:29,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1365283812, now seen corresponding path program 1 times [2019-11-20 10:49:29,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:49:29,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [172311917] [2019-11-20 10:49:29,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:49:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:49:29,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:49:29,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:49:30,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:49:30,021 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:49:30,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:49:30,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:30,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:49:30,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:49:30,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:49:30,073 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:30,074 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:49:30,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:49:30,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:30,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:49:30,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:49:30,092 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:49:30,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:49:30,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:30,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:49:30,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:49:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:49:30,124 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:49:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:49:30,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [172311917] [2019-11-20 10:49:30,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:49:30,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:49:30,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80700867] [2019-11-20 10:49:30,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:49:30,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:49:30,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:49:30,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:49:30,195 INFO L87 Difference]: Start difference. First operand 2107 states and 3204 transitions. Second operand 6 states. [2019-11-20 10:49:36,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:49:36,192 INFO L93 Difference]: Finished difference Result 4583 states and 6902 transitions. [2019-11-20 10:49:36,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:49:36,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2019-11-20 10:49:36,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:49:36,197 INFO L225 Difference]: With dead ends: 4583 [2019-11-20 10:49:36,197 INFO L226 Difference]: Without dead ends: 2484 [2019-11-20 10:49:36,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:49:36,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2019-11-20 10:49:36,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2107. [2019-11-20 10:49:36,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2107 states. [2019-11-20 10:49:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 3170 transitions. [2019-11-20 10:49:36,265 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 3170 transitions. Word has length 103 [2019-11-20 10:49:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:49:36,266 INFO L462 AbstractCegarLoop]: Abstraction has 2107 states and 3170 transitions. [2019-11-20 10:49:36,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:49:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 3170 transitions. [2019-11-20 10:49:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 10:49:36,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:49:36,268 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:49:36,472 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:49:36,473 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:49:36,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:49:36,473 INFO L82 PathProgramCache]: Analyzing trace with hash -306666064, now seen corresponding path program 1 times [2019-11-20 10:49:36,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:49:36,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1350060664] [2019-11-20 10:49:36,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:49:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:49:36,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:49:36,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:49:36,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:49:36,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:49:36,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:49:36,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:36,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:49:36,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:49:36,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:49:36,910 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:36,910 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:49:36,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:49:36,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:36,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:49:36,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:49:36,921 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:49:36,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:49:36,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:36,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:49:36,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:49:36,946 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 10:49:36,946 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:49:37,006 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 10:49:37,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1350060664] [2019-11-20 10:49:37,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:49:37,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:49:37,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485332300] [2019-11-20 10:49:37,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:49:37,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:49:37,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:49:37,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:49:37,008 INFO L87 Difference]: Start difference. First operand 2107 states and 3170 transitions. Second operand 6 states. [2019-11-20 10:49:45,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:49:45,701 INFO L93 Difference]: Finished difference Result 4793 states and 7143 transitions. [2019-11-20 10:49:45,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:49:45,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2019-11-20 10:49:45,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:49:45,707 INFO L225 Difference]: With dead ends: 4793 [2019-11-20 10:49:45,708 INFO L226 Difference]: Without dead ends: 2694 [2019-11-20 10:49:45,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:49:45,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2019-11-20 10:49:45,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2282. [2019-11-20 10:49:45,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2019-11-20 10:49:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 3415 transitions. [2019-11-20 10:49:45,781 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 3415 transitions. Word has length 110 [2019-11-20 10:49:45,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:49:45,782 INFO L462 AbstractCegarLoop]: Abstraction has 2282 states and 3415 transitions. [2019-11-20 10:49:45,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:49:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 3415 transitions. [2019-11-20 10:49:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 10:49:45,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:49:45,784 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:49:45,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:49:45,991 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:49:45,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:49:45,992 INFO L82 PathProgramCache]: Analyzing trace with hash -269079662, now seen corresponding path program 1 times [2019-11-20 10:49:45,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:49:45,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [853889828] [2019-11-20 10:49:45,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:49:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:49:46,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:49:46,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:49:46,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:49:46,467 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:49:46,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:49:46,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:46,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:49:46,477 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:49:46,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:49:46,491 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:46,491 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:49:46,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:49:46,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:46,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:49:46,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:49:46,506 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:49:46,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:49:46,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:46,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:49:46,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:49:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 10:49:46,539 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:49:46,577 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 10:49:46,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [853889828] [2019-11-20 10:49:46,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:49:46,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:49:46,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684467810] [2019-11-20 10:49:46,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:49:46,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:49:46,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:49:46,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:49:46,579 INFO L87 Difference]: Start difference. First operand 2282 states and 3415 transitions. Second operand 6 states. [2019-11-20 10:49:52,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:49:52,706 INFO L93 Difference]: Finished difference Result 4930 states and 7319 transitions. [2019-11-20 10:49:52,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:49:52,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2019-11-20 10:49:52,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:49:52,710 INFO L225 Difference]: With dead ends: 4930 [2019-11-20 10:49:52,711 INFO L226 Difference]: Without dead ends: 2656 [2019-11-20 10:49:52,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:49:52,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2019-11-20 10:49:52,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2282. [2019-11-20 10:49:52,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2019-11-20 10:49:52,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 3395 transitions. [2019-11-20 10:49:52,790 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 3395 transitions. Word has length 111 [2019-11-20 10:49:52,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:49:52,790 INFO L462 AbstractCegarLoop]: Abstraction has 2282 states and 3395 transitions. [2019-11-20 10:49:52,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:49:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 3395 transitions. [2019-11-20 10:49:52,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-20 10:49:52,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:49:52,793 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:49:52,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:49:52,998 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:49:52,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:49:52,998 INFO L82 PathProgramCache]: Analyzing trace with hash 328098223, now seen corresponding path program 1 times [2019-11-20 10:49:52,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:49:52,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2143603811] [2019-11-20 10:49:52,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:49:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:49:53,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:49:53,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:49:53,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:49:53,570 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:49:53,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:49:53,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:53,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:49:53,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:49:53,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:49:53,617 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:53,617 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:49:53,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:49:53,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:53,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:49:53,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:49:53,636 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:49:53,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:49:53,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:49:53,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:49:53,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:49:53,668 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 10:49:53,668 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:49:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 10:49:53,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2143603811] [2019-11-20 10:49:53,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:49:53,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:49:53,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100475039] [2019-11-20 10:49:53,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:49:53,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:49:53,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:49:53,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:49:53,748 INFO L87 Difference]: Start difference. First operand 2282 states and 3395 transitions. Second operand 6 states. [2019-11-20 10:50:02,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:50:02,463 INFO L93 Difference]: Finished difference Result 5146 states and 7584 transitions. [2019-11-20 10:50:02,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:50:02,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-11-20 10:50:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:50:02,467 INFO L225 Difference]: With dead ends: 5146 [2019-11-20 10:50:02,467 INFO L226 Difference]: Without dead ends: 2872 [2019-11-20 10:50:02,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:50:02,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2872 states. [2019-11-20 10:50:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2872 to 2493. [2019-11-20 10:50:02,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2493 states. [2019-11-20 10:50:02,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 3686 transitions. [2019-11-20 10:50:02,554 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 3686 transitions. Word has length 128 [2019-11-20 10:50:02,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:50:02,555 INFO L462 AbstractCegarLoop]: Abstraction has 2493 states and 3686 transitions. [2019-11-20 10:50:02,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:50:02,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 3686 transitions. [2019-11-20 10:50:02,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-20 10:50:02,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:50:02,558 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 10:50:02,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:50:02,763 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:50:02,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:50:02,765 INFO L82 PathProgramCache]: Analyzing trace with hash 4807921, now seen corresponding path program 1 times [2019-11-20 10:50:02,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:50:02,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1135008669] [2019-11-20 10:50:02,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:50:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:50:03,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:50:03,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:50:03,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:50:03,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:50:03,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:50:03,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:03,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:50:03,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:50:03,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:50:03,334 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:03,334 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:50:03,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:50:03,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:03,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:50:03,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:50:03,345 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:50:03,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:50:03,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:03,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:50:03,347 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:50:03,371 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 10:50:03,371 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:50:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 10:50:03,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1135008669] [2019-11-20 10:50:03,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:50:03,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:50:03,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495605952] [2019-11-20 10:50:03,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:50:03,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:50:03,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:50:03,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:50:03,414 INFO L87 Difference]: Start difference. First operand 2493 states and 3686 transitions. Second operand 6 states. [2019-11-20 10:50:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:50:09,227 INFO L93 Difference]: Finished difference Result 5351 states and 7858 transitions. [2019-11-20 10:50:09,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:50:09,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-11-20 10:50:09,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:50:09,231 INFO L225 Difference]: With dead ends: 5351 [2019-11-20 10:50:09,231 INFO L226 Difference]: Without dead ends: 2818 [2019-11-20 10:50:09,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:50:09,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-11-20 10:50:09,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2448. [2019-11-20 10:50:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2448 states. [2019-11-20 10:50:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 3611 transitions. [2019-11-20 10:50:09,352 INFO L78 Accepts]: Start accepts. Automaton has 2448 states and 3611 transitions. Word has length 129 [2019-11-20 10:50:09,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:50:09,352 INFO L462 AbstractCegarLoop]: Abstraction has 2448 states and 3611 transitions. [2019-11-20 10:50:09,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:50:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 3611 transitions. [2019-11-20 10:50:09,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 10:50:09,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:50:09,355 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-11-20 10:50:09,559 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:50:09,567 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:50:09,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:50:09,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1073062352, now seen corresponding path program 1 times [2019-11-20 10:50:09,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:50:09,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [39533679] [2019-11-20 10:50:09,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:50:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:50:10,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:50:10,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:50:10,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:50:10,351 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:50:10,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:50:10,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:10,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:50:10,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:50:10,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:50:10,373 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:10,373 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:50:10,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:50:10,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:10,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:50:10,380 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:50:10,383 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:50:10,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:50:10,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:10,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:50:10,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:50:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 10:50:10,413 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:50:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 10:50:10,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [39533679] [2019-11-20 10:50:10,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:50:10,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:50:10,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453184424] [2019-11-20 10:50:10,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:50:10,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:50:10,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:50:10,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:50:10,473 INFO L87 Difference]: Start difference. First operand 2448 states and 3611 transitions. Second operand 6 states. [2019-11-20 10:50:16,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:50:16,189 INFO L93 Difference]: Finished difference Result 5423 states and 7949 transitions. [2019-11-20 10:50:16,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:50:16,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-11-20 10:50:16,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:50:16,193 INFO L225 Difference]: With dead ends: 5423 [2019-11-20 10:50:16,193 INFO L226 Difference]: Without dead ends: 2983 [2019-11-20 10:50:16,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:50:16,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2019-11-20 10:50:16,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 2578. [2019-11-20 10:50:16,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2578 states. [2019-11-20 10:50:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3762 transitions. [2019-11-20 10:50:16,284 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3762 transitions. Word has length 130 [2019-11-20 10:50:16,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:50:16,284 INFO L462 AbstractCegarLoop]: Abstraction has 2578 states and 3762 transitions. [2019-11-20 10:50:16,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:50:16,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3762 transitions. [2019-11-20 10:50:16,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-20 10:50:16,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:50:16,287 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-11-20 10:50:16,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:50:16,502 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:50:16,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:50:16,502 INFO L82 PathProgramCache]: Analyzing trace with hash 2024349997, now seen corresponding path program 1 times [2019-11-20 10:50:16,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:50:16,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1770837737] [2019-11-20 10:50:16,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:50:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:50:17,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:50:17,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:50:17,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:50:17,323 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:50:17,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:50:17,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:17,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:50:17,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:50:17,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:50:17,354 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:17,354 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:50:17,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:50:17,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:17,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:50:17,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:50:17,365 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:50:17,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:50:17,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:17,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:50:17,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:50:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 10:50:17,395 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:50:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 10:50:17,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1770837737] [2019-11-20 10:50:17,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:50:17,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:50:17,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799468758] [2019-11-20 10:50:17,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:50:17,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:50:17,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:50:17,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:50:17,437 INFO L87 Difference]: Start difference. First operand 2578 states and 3762 transitions. Second operand 6 states. [2019-11-20 10:50:23,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:50:23,389 INFO L93 Difference]: Finished difference Result 5511 states and 7997 transitions. [2019-11-20 10:50:23,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:50:23,390 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-11-20 10:50:23,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:50:23,392 INFO L225 Difference]: With dead ends: 5511 [2019-11-20 10:50:23,392 INFO L226 Difference]: Without dead ends: 2941 [2019-11-20 10:50:23,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 255 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:50:23,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2019-11-20 10:50:23,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 2578. [2019-11-20 10:50:23,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2578 states. [2019-11-20 10:50:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3713 transitions. [2019-11-20 10:50:23,494 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3713 transitions. Word has length 131 [2019-11-20 10:50:23,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:50:23,495 INFO L462 AbstractCegarLoop]: Abstraction has 2578 states and 3713 transitions. [2019-11-20 10:50:23,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:50:23,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3713 transitions. [2019-11-20 10:50:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-20 10:50:23,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:50:23,498 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:50:23,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:50:23,705 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:50:23,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:50:23,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1262835422, now seen corresponding path program 1 times [2019-11-20 10:50:23,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:50:23,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1159873094] [2019-11-20 10:50:23,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:50:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:50:24,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:50:24,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:50:24,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:50:24,241 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:50:24,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:50:24,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:24,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:50:24,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:50:24,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:50:24,263 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:24,263 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:50:24,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:50:24,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:24,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:50:24,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:50:24,274 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:50:24,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:50:24,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:24,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:50:24,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:50:24,305 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:50:24,305 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:50:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:50:24,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1159873094] [2019-11-20 10:50:24,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:50:24,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:50:24,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302390210] [2019-11-20 10:50:24,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:50:24,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:50:24,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:50:24,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:50:24,384 INFO L87 Difference]: Start difference. First operand 2578 states and 3713 transitions. Second operand 6 states. [2019-11-20 10:50:32,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:50:32,638 INFO L93 Difference]: Finished difference Result 5681 states and 8143 transitions. [2019-11-20 10:50:32,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:50:32,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-11-20 10:50:32,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:50:32,641 INFO L225 Difference]: With dead ends: 5681 [2019-11-20 10:50:32,641 INFO L226 Difference]: Without dead ends: 3111 [2019-11-20 10:50:32,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 281 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:50:32,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2019-11-20 10:50:32,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 2743. [2019-11-20 10:50:32,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2743 states. [2019-11-20 10:50:32,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2743 states to 2743 states and 3923 transitions. [2019-11-20 10:50:32,755 INFO L78 Accepts]: Start accepts. Automaton has 2743 states and 3923 transitions. Word has length 144 [2019-11-20 10:50:32,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:50:32,755 INFO L462 AbstractCegarLoop]: Abstraction has 2743 states and 3923 transitions. [2019-11-20 10:50:32,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:50:32,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2743 states and 3923 transitions. [2019-11-20 10:50:32,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-20 10:50:32,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:50:32,757 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 10:50:32,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:50:32,958 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:50:32,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:50:32,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1804076128, now seen corresponding path program 1 times [2019-11-20 10:50:32,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:50:32,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1743347508] [2019-11-20 10:50:32,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:50:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:50:33,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:50:33,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:50:33,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:50:33,493 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:50:33,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:50:33,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:33,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:50:33,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:50:33,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:50:33,520 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:33,520 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:50:33,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:50:33,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:33,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:50:33,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:50:33,535 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:50:33,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:50:33,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:33,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:50:33,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:50:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:50:33,571 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:50:33,618 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:50:33,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1743347508] [2019-11-20 10:50:33,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:50:33,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:50:33,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143617698] [2019-11-20 10:50:33,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:50:33,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:50:33,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:50:33,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:50:33,620 INFO L87 Difference]: Start difference. First operand 2743 states and 3923 transitions. Second operand 6 states. [2019-11-20 10:50:43,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:50:43,023 INFO L93 Difference]: Finished difference Result 5835 states and 8310 transitions. [2019-11-20 10:50:43,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:50:43,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-11-20 10:50:43,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:50:43,028 INFO L225 Difference]: With dead ends: 5835 [2019-11-20 10:50:43,028 INFO L226 Difference]: Without dead ends: 3046 [2019-11-20 10:50:43,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:50:43,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3046 states. [2019-11-20 10:50:43,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3046 to 2689. [2019-11-20 10:50:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2689 states. [2019-11-20 10:50:43,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 3814 transitions. [2019-11-20 10:50:43,108 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 3814 transitions. Word has length 145 [2019-11-20 10:50:43,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:50:43,108 INFO L462 AbstractCegarLoop]: Abstraction has 2689 states and 3814 transitions. [2019-11-20 10:50:43,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:50:43,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 3814 transitions. [2019-11-20 10:50:43,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-20 10:50:43,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:50:43,110 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-20 10:50:43,311 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:50:43,311 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:50:43,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:50:43,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1040709817, now seen corresponding path program 1 times [2019-11-20 10:50:43,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:50:43,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1592886970] [2019-11-20 10:50:43,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:50:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:50:43,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:50:43,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:50:43,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:50:43,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:50:43,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:50:43,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:43,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:50:43,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:50:43,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:50:43,982 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:43,982 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:50:43,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:50:43,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:43,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:50:43,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:50:44,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:50:44,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:50:44,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:44,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:50:44,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:50:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-20 10:50:44,028 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:50:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-20 10:50:44,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1592886970] [2019-11-20 10:50:44,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:50:44,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:50:44,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146146136] [2019-11-20 10:50:44,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:50:44,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:50:44,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:50:44,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:50:44,130 INFO L87 Difference]: Start difference. First operand 2689 states and 3814 transitions. Second operand 6 states. [2019-11-20 10:50:55,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:50:55,603 INFO L93 Difference]: Finished difference Result 5818 states and 8230 transitions. [2019-11-20 10:50:55,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:50:55,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-11-20 10:50:55,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:50:55,609 INFO L225 Difference]: With dead ends: 5818 [2019-11-20 10:50:55,609 INFO L226 Difference]: Without dead ends: 3137 [2019-11-20 10:50:55,612 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 293 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:50:55,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3137 states. [2019-11-20 10:50:55,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3137 to 2777. [2019-11-20 10:50:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2777 states. [2019-11-20 10:50:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 3883 transitions. [2019-11-20 10:50:55,689 INFO L78 Accepts]: Start accepts. Automaton has 2777 states and 3883 transitions. Word has length 150 [2019-11-20 10:50:55,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:50:55,689 INFO L462 AbstractCegarLoop]: Abstraction has 2777 states and 3883 transitions. [2019-11-20 10:50:55,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:50:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 3883 transitions. [2019-11-20 10:50:55,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 10:50:55,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:50:55,691 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-20 10:50:55,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:50:55,891 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:50:55,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:50:55,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2042951894, now seen corresponding path program 1 times [2019-11-20 10:50:55,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:50:55,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1818359761] [2019-11-20 10:50:55,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:50:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:50:56,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:50:56,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:50:56,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:50:56,569 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:50:56,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:50:56,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:56,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:50:56,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:50:56,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:50:56,594 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:56,594 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:50:56,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:50:56,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:56,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:50:56,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:50:56,604 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:50:56,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:50:56,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:50:56,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:50:56,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:50:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-20 10:50:56,629 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:50:56,681 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-20 10:50:56,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1818359761] [2019-11-20 10:50:56,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:50:56,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:50:56,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023581345] [2019-11-20 10:50:56,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:50:56,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:50:56,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:50:56,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:50:56,684 INFO L87 Difference]: Start difference. First operand 2777 states and 3883 transitions. Second operand 6 states. [2019-11-20 10:51:02,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:51:02,437 INFO L93 Difference]: Finished difference Result 5886 states and 8209 transitions. [2019-11-20 10:51:02,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:51:02,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2019-11-20 10:51:02,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:51:02,442 INFO L225 Difference]: With dead ends: 5886 [2019-11-20 10:51:02,442 INFO L226 Difference]: Without dead ends: 3117 [2019-11-20 10:51:02,444 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:51:02,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3117 states. [2019-11-20 10:51:02,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3117 to 2777. [2019-11-20 10:51:02,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2777 states. [2019-11-20 10:51:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 3824 transitions. [2019-11-20 10:51:02,526 INFO L78 Accepts]: Start accepts. Automaton has 2777 states and 3824 transitions. Word has length 151 [2019-11-20 10:51:02,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:51:02,526 INFO L462 AbstractCegarLoop]: Abstraction has 2777 states and 3824 transitions. [2019-11-20 10:51:02,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:51:02,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 3824 transitions. [2019-11-20 10:51:02,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-20 10:51:02,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:51:02,528 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:51:02,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:51:02,732 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:51:02,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:51:02,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1230057042, now seen corresponding path program 1 times [2019-11-20 10:51:02,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:51:02,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1969322188] [2019-11-20 10:51:02,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:51:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:51:03,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:51:03,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:51:03,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:03,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:51:03,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:51:03,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:03,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:51:03,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:51:03,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:03,857 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:03,857 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:51:03,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:51:03,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:03,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:51:03,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:51:03,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:51:03,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:51:03,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:03,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:51:03,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:51:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-20 10:51:03,908 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:51:03,976 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-20 10:51:03,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1969322188] [2019-11-20 10:51:03,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:51:03,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:51:03,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051764706] [2019-11-20 10:51:03,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:51:03,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:51:03,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:51:03,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:51:03,979 INFO L87 Difference]: Start difference. First operand 2777 states and 3824 transitions. Second operand 6 states. [2019-11-20 10:51:12,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:51:12,004 INFO L93 Difference]: Finished difference Result 6011 states and 8265 transitions. [2019-11-20 10:51:12,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:51:12,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-11-20 10:51:12,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:51:12,011 INFO L225 Difference]: With dead ends: 6011 [2019-11-20 10:51:12,011 INFO L226 Difference]: Without dead ends: 3242 [2019-11-20 10:51:12,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 297 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:51:12,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2019-11-20 10:51:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 2897. [2019-11-20 10:51:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2897 states. [2019-11-20 10:51:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 3935 transitions. [2019-11-20 10:51:12,092 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 3935 transitions. Word has length 152 [2019-11-20 10:51:12,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:51:12,092 INFO L462 AbstractCegarLoop]: Abstraction has 2897 states and 3935 transitions. [2019-11-20 10:51:12,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:51:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 3935 transitions. [2019-11-20 10:51:12,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-20 10:51:12,094 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:51:12,094 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:51:12,294 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:51:12,295 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:51:12,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:51:12,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1969860117, now seen corresponding path program 1 times [2019-11-20 10:51:12,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:51:12,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [515291857] [2019-11-20 10:51:12,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:51:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:51:13,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:51:13,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:51:13,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:13,438 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:51:13,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:51:13,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:13,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:51:13,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:51:13,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:13,460 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:13,461 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:51:13,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:51:13,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:13,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:51:13,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:51:13,471 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:51:13,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:51:13,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:13,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:51:13,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:51:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-20 10:51:13,498 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:51:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-20 10:51:13,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [515291857] [2019-11-20 10:51:13,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:51:13,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:51:13,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822017932] [2019-11-20 10:51:13,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:51:13,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:51:13,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:51:13,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:51:13,541 INFO L87 Difference]: Start difference. First operand 2897 states and 3935 transitions. Second operand 6 states. [2019-11-20 10:51:20,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:51:20,414 INFO L93 Difference]: Finished difference Result 5521 states and 7502 transitions. [2019-11-20 10:51:20,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:51:20,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-11-20 10:51:20,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:51:20,419 INFO L225 Difference]: With dead ends: 5521 [2019-11-20 10:51:20,419 INFO L226 Difference]: Without dead ends: 2608 [2019-11-20 10:51:20,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:51:20,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2019-11-20 10:51:20,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 2332. [2019-11-20 10:51:20,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2332 states. [2019-11-20 10:51:20,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 3127 transitions. [2019-11-20 10:51:20,494 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 3127 transitions. Word has length 153 [2019-11-20 10:51:20,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:51:20,495 INFO L462 AbstractCegarLoop]: Abstraction has 2332 states and 3127 transitions. [2019-11-20 10:51:20,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:51:20,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 3127 transitions. [2019-11-20 10:51:20,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-20 10:51:20,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:51:20,497 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-11-20 10:51:20,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:51:20,699 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:51:20,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:51:20,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2119093808, now seen corresponding path program 1 times [2019-11-20 10:51:20,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:51:20,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [35873302] [2019-11-20 10:51:20,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:51:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:51:20,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:51:20,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:51:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:51:20,967 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:51:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:51:20,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [35873302] [2019-11-20 10:51:20,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:51:20,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 10:51:20,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124635845] [2019-11-20 10:51:20,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:51:20,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:51:20,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:51:20,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:51:20,987 INFO L87 Difference]: Start difference. First operand 2332 states and 3127 transitions. Second operand 3 states. [2019-11-20 10:51:21,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:51:21,411 INFO L93 Difference]: Finished difference Result 5185 states and 6958 transitions. [2019-11-20 10:51:21,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:51:21,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-20 10:51:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:51:21,413 INFO L225 Difference]: With dead ends: 5185 [2019-11-20 10:51:21,414 INFO L226 Difference]: Without dead ends: 2885 [2019-11-20 10:51:21,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:51:21,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2019-11-20 10:51:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 2883. [2019-11-20 10:51:21,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2883 states. [2019-11-20 10:51:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2883 states and 3859 transitions. [2019-11-20 10:51:21,499 INFO L78 Accepts]: Start accepts. Automaton has 2883 states and 3859 transitions. Word has length 166 [2019-11-20 10:51:21,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:51:21,499 INFO L462 AbstractCegarLoop]: Abstraction has 2883 states and 3859 transitions. [2019-11-20 10:51:21,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:51:21,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 3859 transitions. [2019-11-20 10:51:21,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-20 10:51:21,501 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:51:21,501 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] [2019-11-20 10:51:21,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:51:21,702 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:51:21,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:51:21,702 INFO L82 PathProgramCache]: Analyzing trace with hash 269568957, now seen corresponding path program 1 times [2019-11-20 10:51:21,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:51:21,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [980744777] [2019-11-20 10:51:21,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:51:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:51:21,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:51:21,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:51:21,935 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-20 10:51:21,936 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:51:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-20 10:51:21,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [980744777] [2019-11-20 10:51:21,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:51:21,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 10:51:21,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803637646] [2019-11-20 10:51:21,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:51:21,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:51:21,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:51:21,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:51:21,973 INFO L87 Difference]: Start difference. First operand 2883 states and 3859 transitions. Second operand 4 states. [2019-11-20 10:51:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:51:22,739 INFO L93 Difference]: Finished difference Result 6872 states and 9215 transitions. [2019-11-20 10:51:22,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:51:22,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-11-20 10:51:22,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:51:22,744 INFO L225 Difference]: With dead ends: 6872 [2019-11-20 10:51:22,744 INFO L226 Difference]: Without dead ends: 4021 [2019-11-20 10:51:22,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:51:22,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4021 states. [2019-11-20 10:51:22,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4021 to 3975. [2019-11-20 10:51:22,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3975 states. [2019-11-20 10:51:22,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 5337 transitions. [2019-11-20 10:51:22,864 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 5337 transitions. Word has length 167 [2019-11-20 10:51:22,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:51:22,865 INFO L462 AbstractCegarLoop]: Abstraction has 3975 states and 5337 transitions. [2019-11-20 10:51:22,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:51:22,865 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 5337 transitions. [2019-11-20 10:51:22,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-20 10:51:22,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:51:22,867 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] [2019-11-20 10:51:23,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:51:23,067 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:51:23,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:51:23,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1900769027, now seen corresponding path program 1 times [2019-11-20 10:51:23,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:51:23,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [558416277] [2019-11-20 10:51:23,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:51:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:51:24,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-20 10:51:24,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:51:24,405 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:24,405 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-20 10:51:24,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:51:24,818 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 10:51:24,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:24,819 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_359|], 2=[|v_#memory_$Pointer$.base_356|, |v_#memory_$Pointer$.base_355|]} [2019-11-20 10:51:24,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:24,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:24,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:24,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:24,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:24,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:24,956 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 10:51:24,956 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:51:25,171 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 10:51:25,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:25,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,210 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 10:51:25,211 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:51:25,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:25,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,281 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 10:51:25,282 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:51:25,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:25,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:51:25,305 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:98, output treesize:56 [2019-11-20 10:51:25,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,335 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:25,336 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 72 treesize of output 44 [2019-11-20 10:51:25,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:51:25,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:25,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:51:25,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 10:51:25,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,372 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:25,372 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 72 treesize of output 44 [2019-11-20 10:51:25,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:51:25,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:25,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:51:25,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 10:51:25,395 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_357|], 12=[|v_#memory_$Pointer$.base_362|]} [2019-11-20 10:51:25,400 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:51:25,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:25,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,494 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:25,495 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 77 treesize of output 53 [2019-11-20 10:51:25,495 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:51:25,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:25,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:51:25,516 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-20 10:51:25,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,532 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:25,532 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 72 treesize of output 44 [2019-11-20 10:51:25,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:51:25,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:25,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:51:25,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 10:51:25,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,561 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:25,561 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 72 treesize of output 44 [2019-11-20 10:51:25,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:51:25,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:25,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:51:25,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 10:51:25,584 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_355|], 20=[|v_#memory_$Pointer$.base_365|]} [2019-11-20 10:51:25,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,593 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-11-20 10:51:25,593 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 10:51:25,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:25,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:25,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:26,095 WARN L191 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-20 10:51:26,095 INFO L343 Elim1Store]: treesize reduction 34, result has 84.6 percent of original size [2019-11-20 10:51:26,096 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 90 treesize of output 218 [2019-11-20 10:51:26,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:51:26,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:51:26,461 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 7 xjuncts. [2019-11-20 10:51:27,380 WARN L191 SmtUtils]: Spent 918.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 66 [2019-11-20 10:51:27,380 INFO L567 ElimStorePlain]: treesize reduction 2989, result has 8.6 percent of original size [2019-11-20 10:51:27,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-20 10:51:27,382 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:298 [2019-11-20 10:51:27,978 WARN L191 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2019-11-20 10:51:27,987 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_358|], 30=[|v_#memory_$Pointer$.base_366|]} [2019-11-20 10:51:27,998 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:51:28,111 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 10:51:28,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:51:28,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:28,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:28,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:28,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:28,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:28,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:28,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:28,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:28,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:51:28,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:52:01,274 WARN L191 SmtUtils]: Spent 33.14 s on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2019-11-20 10:52:01,274 INFO L343 Elim1Store]: treesize reduction 22, result has 92.6 percent of original size [2019-11-20 10:52:01,274 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 104 treesize of output 338 [2019-11-20 10:52:01,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:01,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:01,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:01,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:01,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:01,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:01,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:01,282 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:52:01,692 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 40 [2019-11-20 10:52:01,692 INFO L567 ElimStorePlain]: treesize reduction 11103, result has 0.8 percent of original size [2019-11-20 10:52:01,693 INFO L496 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-11-20 10:52:01,693 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:121, output treesize:83 [2019-11-20 10:52:01,737 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_435|], 30=[|v_#memory_$Pointer$.base_367|]} [2019-11-20 10:52:01,757 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 10:52:01,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:52:01,864 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 10:52:01,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:52:01,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:52:01,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:52:01,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:52:01,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:52:01,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:52:01,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:52:18,260 WARN L191 SmtUtils]: Spent 16.39 s on a formula simplification that was a NOOP. DAG size: 79 [2019-11-20 10:52:18,260 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:52:18,261 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 99 treesize of output 263 [2019-11-20 10:52:18,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:18,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,267 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:52:18,634 WARN L191 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 42 [2019-11-20 10:52:18,634 INFO L567 ElimStorePlain]: treesize reduction 9801, result has 0.9 percent of original size [2019-11-20 10:52:18,635 INFO L496 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-11-20 10:52:18,635 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:92 [2019-11-20 10:52:18,693 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_356|], 2=[|v_#memory_int_436|], 20=[|v_#memory_$Pointer$.base_368|]} [2019-11-20 10:52:18,715 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-11-20 10:52:18,715 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:52:18,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:52:18,776 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2019-11-20 10:52:18,776 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:52:18,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:52:18,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:52:18,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:52:18,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:52:18,955 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 10:52:18,955 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:52:18,955 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 95 treesize of output 147 [2019-11-20 10:52:18,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:18,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:19,078 INFO L496 ElimStorePlain]: Start of recursive call 4: 125 dim-0 vars, End of recursive call: 125 dim-0 vars, and 16 xjuncts. [2019-11-20 10:52:40,867 WARN L191 SmtUtils]: Spent 21.79 s on a formula simplification that was a NOOP. DAG size: 1153 [2019-11-20 10:52:40,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:52:40,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 10:52:40,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 10:52:40,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:40,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:40,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 10:52:40,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:40,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:40,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 10:52:40,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 12 terms [2019-11-20 10:52:40,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 10:52:40,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:40,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 10:52:40,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:40,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 10:52:40,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:40,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:40,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:40,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 10:52:40,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:52:40,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:52:40,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 250 dim-0 vars, and 1 xjuncts. [2019-11-20 10:52:40,953 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:123, output treesize:2014 [2019-11-20 10:52:42,494 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 1390 DAG size of output: 25 [2019-11-20 10:52:42,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:52:42,500 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 34 treesize of output 36 [2019-11-20 10:52:42,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:52:42,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:52:42,517 INFO L496 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-11-20 10:52:42,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:37 [2019-11-20 10:52:42,581 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 33 treesize of output 15 [2019-11-20 10:52:42,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:52:42,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:52:42,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:52:42,602 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:3 [2019-11-20 10:52:42,881 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 64 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:52:42,881 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:52:42,938 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 38 treesize of output 32 [2019-11-20 10:52:42,938 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:52:42,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:52:42,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:52:42,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-11-20 10:52:43,001 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:52:43,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:52:43,012 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:52:43,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:52:43,022 INFO L496 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-11-20 10:52:43,022 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:15 [2019-11-20 10:52:43,057 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_372|], 2=[|v_#memory_$Pointer$.base_358|]} [2019-11-20 10:52:43,061 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:52:43,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:52:43,085 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:52:43,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:52:43,093 INFO L496 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-11-20 10:52:43,093 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:25 [2019-11-20 10:52:43,119 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 10:52:43,119 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-11-20 10:52:43,119 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 10:52:43,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:52:43,126 INFO L496 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-11-20 10:52:43,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:49 [2019-11-20 10:52:43,217 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:52:43,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:52:43,234 INFO L496 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-11-20 10:52:43,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 10:52:43,555 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:52:43,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:52:43,564 INFO L496 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-11-20 10:52:43,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 10:52:43,721 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_357|], 20=[|v_#memory_$Pointer$.base_376|]} [2019-11-20 10:52:43,730 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:52:43,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:52:43,793 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:52:43,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:52:43,805 INFO L496 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-11-20 10:52:43,805 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:90, output treesize:124 [2019-11-20 10:52:44,057 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:52:44,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:52:44,069 INFO L496 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-11-20 10:52:44,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 10:52:44,231 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:52:44,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:52:44,240 INFO L496 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-11-20 10:52:44,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 10:52:44,605 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:52:44,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [558416277] [2019-11-20 10:52:44,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:52:44,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-20 10:52:44,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613330487] [2019-11-20 10:52:44,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 10:52:44,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:52:44,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 10:52:44,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-20 10:52:44,607 INFO L87 Difference]: Start difference. First operand 3975 states and 5337 transitions. Second operand 13 states. [2019-11-20 10:53:10,135 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-11-20 10:54:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:54:54,346 INFO L93 Difference]: Finished difference Result 13731 states and 18392 transitions. [2019-11-20 10:54:54,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 10:54:54,348 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 167 [2019-11-20 10:54:54,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:54:54,355 INFO L225 Difference]: With dead ends: 13731 [2019-11-20 10:54:54,355 INFO L226 Difference]: Without dead ends: 9732 [2019-11-20 10:54:54,359 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 314 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=122, Invalid=294, Unknown=4, NotChecked=0, Total=420 [2019-11-20 10:54:54,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9732 states. [2019-11-20 10:54:54,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9732 to 7541. [2019-11-20 10:54:54,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7541 states. [2019-11-20 10:54:54,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7541 states to 7541 states and 10142 transitions. [2019-11-20 10:54:54,752 INFO L78 Accepts]: Start accepts. Automaton has 7541 states and 10142 transitions. Word has length 167 [2019-11-20 10:54:54,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:54:54,752 INFO L462 AbstractCegarLoop]: Abstraction has 7541 states and 10142 transitions. [2019-11-20 10:54:54,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 10:54:54,752 INFO L276 IsEmpty]: Start isEmpty. Operand 7541 states and 10142 transitions. [2019-11-20 10:54:54,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-20 10:54:54,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:54:54,755 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:54:54,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:54:54,958 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:54:54,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:54:54,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1918301126, now seen corresponding path program 1 times [2019-11-20 10:54:54,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:54:54,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [160430158] [2019-11-20 10:54:54,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:54:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:54:57,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-20 10:54:57,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:54:58,025 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 10:54:58,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:54:59,285 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 68 [2019-11-20 10:54:59,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:54:59,287 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_372|, |v_#memory_$Pointer$.base_384|], 2=[|v_#memory_$Pointer$.offset_368|, |v_#memory_$Pointer$.offset_369|, |v_#memory_$Pointer$.base_381|, |v_#memory_$Pointer$.base_380|]} [2019-11-20 10:54:59,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:54:59,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:54:59,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:54:59,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:54:59,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:54:59,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:54:59,722 INFO L237 Elim1Store]: Index analysis took 343 ms [2019-11-20 10:54:59,979 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 10:54:59,979 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:01,144 WARN L191 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 65 [2019-11-20 10:55:01,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:01,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:01,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:01,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:01,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:01,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:01,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:01,404 INFO L237 Elim1Store]: Index analysis took 193 ms [2019-11-20 10:55:01,601 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 10:55:01,602 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:02,308 WARN L191 SmtUtils]: Spent 705.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-20 10:55:02,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:02,318 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:02,749 WARN L191 SmtUtils]: Spent 429.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 10:55:02,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:02,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:02,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:02,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:02,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:02,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:02,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:02,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:02,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:02,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:02,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:02,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-11-20 10:55:02,844 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:03,034 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-20 10:55:03,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:03,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,078 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 10:55:03,078 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:03,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:03,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,171 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 10:55:03,172 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:03,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:03,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:55:03,212 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:156, output treesize:23 [2019-11-20 10:55:03,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:55:03,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:03,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:03,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,277 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 10:55:03,277 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:03,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:03,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:55:03,297 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-20 10:55:03,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:55:03,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:03,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:03,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,349 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 10:55:03,349 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:03,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:03,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:55:03,369 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-20 10:55:03,380 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:03,553 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 10:55:03,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:03,559 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:03,661 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-20 10:55:03,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:03,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,680 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-20 10:55:03,680 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:03,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:03,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,749 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 34 treesize of output 22 [2019-11-20 10:55:03,749 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:03,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:03,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:55:03,772 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-20 10:55:03,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 10:55:03,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:03,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:03,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,819 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:55:03,819 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:03,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:03,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:55:03,838 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-20 10:55:03,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,856 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 10:55:03,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:03,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:03,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:03,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:55:03,892 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:03,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:03,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:55:03,902 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-20 10:55:03,912 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:04,105 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 10:55:04,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:04,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:04,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:04,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:04,140 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-20 10:55:04,140 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:04,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:04,230 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:04,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:04,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:04,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:04,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:04,295 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 34 treesize of output 22 [2019-11-20 10:55:04,295 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:04,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:04,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:55:04,321 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-20 10:55:04,326 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_449|], 2=[|v_#memory_$Pointer$.offset_379|, |v_#memory_$Pointer$.base_391|]} [2019-11-20 10:55:04,337 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2019-11-20 10:55:04,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:04,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:04,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 95 [2019-11-20 10:55:04,407 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:04,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:04,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:04,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 59 [2019-11-20 10:55:04,442 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:04,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:04,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:55:04,460 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:152, output treesize:44 [2019-11-20 10:55:04,489 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 35 treesize of output 7 [2019-11-20 10:55:04,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:04,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:04,502 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 8 treesize of output 4 [2019-11-20 10:55:04,503 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:04,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:04,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-20 10:55:04,516 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:04,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:04,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:55:04,518 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:50, output treesize:5 [2019-11-20 10:55:04,633 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-20 10:55:04,633 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:55:04,666 INFO L392 ElimStorePlain]: Different costs {1=[|#memory_int|], 2=[|v_#memory_$Pointer$.offset_384|, |v_#memory_$Pointer$.base_396|]} [2019-11-20 10:55:04,694 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 58 treesize of output 40 [2019-11-20 10:55:04,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 10:55:04,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:04,766 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-20 10:55:04,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:04,818 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-20 10:55:04,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:04,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-20 10:55:04,845 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:151, output treesize:91 [2019-11-20 10:55:04,914 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_383|, |v_#memory_$Pointer$.offset_371|, |v_#memory_$Pointer$.offset_385|], 7=[|v_#memory_$Pointer$.base_397|]} [2019-11-20 10:55:04,924 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:05,056 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 10:55:05,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:05,065 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:05,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:05,158 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:05,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:05,212 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:05,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:05,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:05,233 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:124, output treesize:113 [2019-11-20 10:55:05,329 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_386|], 7=[|v_#memory_$Pointer$.base_398|]} [2019-11-20 10:55:05,333 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:05,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:05,380 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:05,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:05,394 INFO L496 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-11-20 10:55:05,395 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:83 [2019-11-20 10:55:05,457 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_387|], 7=[|v_#memory_$Pointer$.base_399|]} [2019-11-20 10:55:05,460 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:05,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:05,504 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:05,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:05,518 INFO L496 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-11-20 10:55:05,519 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:83 [2019-11-20 10:55:05,598 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_382|, |v_#memory_$Pointer$.offset_370|, |v_#memory_$Pointer$.offset_388|], 7=[|v_#memory_$Pointer$.base_400|]} [2019-11-20 10:55:05,610 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:05,737 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 10:55:05,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:05,746 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:05,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:05,836 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:05,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:05,884 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:05,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:05,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:05,904 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:124, output treesize:113 [2019-11-20 10:55:05,984 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_389|], 7=[|v_#memory_$Pointer$.base_401|]} [2019-11-20 10:55:05,988 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:06,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:06,030 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:06,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:06,042 INFO L496 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-11-20 10:55:06,042 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:83 [2019-11-20 10:55:06,110 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_390|], 7=[|v_#memory_$Pointer$.base_402|]} [2019-11-20 10:55:06,114 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:06,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:06,160 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:06,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:06,178 INFO L496 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-11-20 10:55:06,179 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:83 [2019-11-20 10:55:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-20 10:55:06,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [160430158] [2019-11-20 10:55:06,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:55:06,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-20 10:55:06,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029874547] [2019-11-20 10:55:06,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 10:55:06,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:55:06,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 10:55:06,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:55:06,423 INFO L87 Difference]: Start difference. First operand 7541 states and 10142 transitions. Second operand 8 states. [2019-11-20 10:55:19,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:55:19,283 INFO L93 Difference]: Finished difference Result 19904 states and 26781 transitions. [2019-11-20 10:55:19,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 10:55:19,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 191 [2019-11-20 10:55:19,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:55:19,292 INFO L225 Difference]: With dead ends: 19904 [2019-11-20 10:55:19,292 INFO L226 Difference]: Without dead ends: 12395 [2019-11-20 10:55:19,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 368 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:55:19,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12395 states. [2019-11-20 10:55:19,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12395 to 9810. [2019-11-20 10:55:19,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9810 states. [2019-11-20 10:55:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9810 states to 9810 states and 13255 transitions. [2019-11-20 10:55:19,696 INFO L78 Accepts]: Start accepts. Automaton has 9810 states and 13255 transitions. Word has length 191 [2019-11-20 10:55:19,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:55:19,696 INFO L462 AbstractCegarLoop]: Abstraction has 9810 states and 13255 transitions. [2019-11-20 10:55:19,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 10:55:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 9810 states and 13255 transitions. [2019-11-20 10:55:19,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-20 10:55:19,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:55:19,701 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:55:19,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:55:19,911 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:55:19,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:55:19,912 INFO L82 PathProgramCache]: Analyzing trace with hash -529007112, now seen corresponding path program 1 times [2019-11-20 10:55:19,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:55:19,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1105384735] [2019-11-20 10:55:19,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_020a20bd-894a-4328-b16b-2587c61f81a2/bin/uautomizer/cvc4 Starting monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:55:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:55:22,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-20 10:55:22,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:55:22,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 10:55:22,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:23,901 WARN L191 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 68 [2019-11-20 10:55:23,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:23,904 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_411|, |v_#memory_$Pointer$.offset_399|], 2=[|v_#memory_$Pointer$.base_405|, |v_#memory_$Pointer$.base_404|, |v_#memory_$Pointer$.offset_392|, |v_#memory_$Pointer$.offset_393|]} [2019-11-20 10:55:23,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:24,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:24,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:24,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:24,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:24,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:24,286 INFO L237 Elim1Store]: Index analysis took 327 ms [2019-11-20 10:55:24,488 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 10:55:24,488 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:25,282 WARN L191 SmtUtils]: Spent 794.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-20 10:55:25,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:25,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:25,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:25,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:25,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:25,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:25,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:25,565 INFO L237 Elim1Store]: Index analysis took 229 ms [2019-11-20 10:55:25,738 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 10:55:25,738 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:26,403 WARN L191 SmtUtils]: Spent 664.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-20 10:55:26,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:26,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:26,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:26,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:26,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:26,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:26,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:26,599 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 10:55:26,599 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:26,931 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 10:55:26,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:26,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:26,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:26,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:26,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:26,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:26,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:26,986 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 10:55:26,986 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:27,134 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-20 10:55:27,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:27,138 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:27,277 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 10:55:27,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:27,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,294 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-11-20 10:55:27,295 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:27,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:27,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:55:27,334 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:156, output treesize:23 [2019-11-20 10:55:27,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,352 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 10:55:27,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:27,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:27,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,376 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:55:27,376 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:27,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:27,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:55:27,384 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-20 10:55:27,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,392 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:55:27,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:27,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:27,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,414 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 10:55:27,414 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:27,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:27,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:55:27,424 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-20 10:55:27,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,510 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:55:27,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:27,612 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-20 10:55:27,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:27,620 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:27,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:27,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,688 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-20 10:55:27,688 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:27,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:27,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,712 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:55:27,713 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:27,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:27,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:55:27,724 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-20 10:55:27,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:55:27,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:27,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:27,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,763 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 10:55:27,763 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:27,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:27,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:55:27,771 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-20 10:55:27,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,777 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:55:27,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:27,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:27,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,803 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 10:55:27,804 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:27,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:27,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:55:27,811 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-20 10:55:27,819 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:27,929 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 10:55:27,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:27,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:27,986 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:55:27,986 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:28,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:28,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:28,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:28,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:28,080 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-20 10:55:28,080 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:28,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:28,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:28,119 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:55:28,119 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:28,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:28,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:55:28,142 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-20 10:55:28,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:28,151 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 75 [2019-11-20 10:55:28,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:28,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:28,183 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-11-20 10:55:28,184 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:28,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:28,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:55:28,195 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:121, output treesize:23 [2019-11-20 10:55:28,206 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:28,370 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 10:55:28,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:28,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:28,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:28,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:28,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-20 10:55:28,403 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:28,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:28,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:28,500 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:55:28,500 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:28,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:28,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:28,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:55:28,526 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:28,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:28,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:55:28,537 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-20 10:55:28,543 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 80 [2019-11-20 10:55:28,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:28,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:28,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:28,562 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-11-20 10:55:28,562 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:28,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:28,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:55:28,570 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:121, output treesize:23 [2019-11-20 10:55:28,572 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_462|], 2=[|v_#memory_$Pointer$.base_409|, |v_#memory_$Pointer$.offset_409|, |v_#memory_$Pointer$.base_421|, |v_#memory_$Pointer$.offset_397|], 6=[|v_#memory_$Pointer$.base_410|, |v_#memory_$Pointer$.offset_398|]} [2019-11-20 10:55:28,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:28,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:28,708 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-11-20 10:55:28,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:29,565 WARN L191 SmtUtils]: Spent 855.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-20 10:55:29,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:29,577 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:30,574 WARN L191 SmtUtils]: Spent 996.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-20 10:55:30,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:30,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:30,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:55:30,673 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:31,094 WARN L191 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-20 10:55:31,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:31,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:31,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 10:55:31,148 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:31,358 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 10:55:31,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:31,363 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:31,665 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-20 10:55:31,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:31,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:31,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:31,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:31,673 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 98 [2019-11-20 10:55:31,673 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:31,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:31,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:31,748 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 61 [2019-11-20 10:55:31,748 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:31,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:31,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:55:31,776 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:306, output treesize:54 [2019-11-20 10:55:31,805 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_422|, |v_#memory_$Pointer$.offset_410|], 20=[|v_#memory_int_463|]} [2019-11-20 10:55:31,808 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 55 treesize of output 37 [2019-11-20 10:55:31,808 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:31,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:31,840 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 35 treesize of output 23 [2019-11-20 10:55:31,840 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:31,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:31,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:55:31,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2019-11-20 10:55:31,866 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:31,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:31,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:31,879 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:85, output treesize:37 [2019-11-20 10:55:31,923 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 33 treesize of output 13 [2019-11-20 10:55:31,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:55:31,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:31,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:55:31,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:3 [2019-11-20 10:55:32,215 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 10:55:32,215 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:55:32,283 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_412|, |v_#memory_$Pointer$.base_409|, |v_#memory_$Pointer$.base_424|, |v_#memory_$Pointer$.offset_397|], 3=[|#memory_int|], 6=[|v_#memory_$Pointer$.base_410|, |v_#memory_$Pointer$.offset_398|]} [2019-11-20 10:55:32,329 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:33,231 WARN L191 SmtUtils]: Spent 901.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-20 10:55:33,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:33,248 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:34,162 WARN L191 SmtUtils]: Spent 914.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-20 10:55:34,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:34,170 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:34,561 WARN L191 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-20 10:55:34,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:34,565 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:34,779 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-20 10:55:34,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:34,786 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 1557 treesize of output 1221 [2019-11-20 10:55:34,787 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-11-20 10:55:35,286 WARN L191 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-11-20 10:55:35,286 INFO L567 ElimStorePlain]: treesize reduction 924, result has 25.8 percent of original size [2019-11-20 10:55:35,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,296 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:35,587 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 10:55:35,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:35,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,597 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:35,817 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 10:55:35,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:35,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:35,820 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:309, output treesize:500 [2019-11-20 10:55:35,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:35,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:36,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:36,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:36,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:36,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:36,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:36,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:36,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:55:36,046 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:36,064 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:36,132 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:36,164 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:42,381 WARN L191 SmtUtils]: Spent 6.22 s on a formula simplification. DAG size of input: 121 DAG size of output: 120 [2019-11-20 10:55:42,381 INFO L567 ElimStorePlain]: treesize reduction 105, result has 94.8 percent of original size [2019-11-20 10:55:42,405 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:42,426 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:42,443 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:42,481 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:47,105 WARN L191 SmtUtils]: Spent 4.62 s on a formula simplification that was a NOOP. DAG size: 140 [2019-11-20 10:55:47,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:47,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 28 dim-0 vars, and 4 xjuncts. [2019-11-20 10:55:47,106 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:1227, output treesize:2625 [2019-11-20 10:55:53,213 WARN L191 SmtUtils]: Spent 3.33 s on a formula simplification. DAG size of input: 158 DAG size of output: 45 [2019-11-20 10:55:53,229 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_408|, |v_#memory_$Pointer$.offset_396|], 6=[|v_#memory_$Pointer$.offset_414|], 14=[|v_#memory_$Pointer$.base_426|]} [2019-11-20 10:55:53,263 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:53,685 WARN L191 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-20 10:55:53,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:53,693 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:53,876 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-20 10:55:53,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:53,880 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:54,017 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-20 10:55:54,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:54,020 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:54,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:54,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:54,078 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:393, output treesize:792 [2019-11-20 10:55:58,012 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_415|], 14=[|v_#memory_$Pointer$.base_427|]} [2019-11-20 10:55:58,014 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:58,145 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-20 10:55:58,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:58,147 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:58,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:55:58,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-20 10:55:58,180 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:413, output treesize:1432 [2019-11-20 10:56:04,342 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_407|, |v_#memory_$Pointer$.offset_395|], 19=[|v_#memory_$Pointer$.offset_416|], 31=[|v_#memory_$Pointer$.base_428|]} [2019-11-20 10:56:04,377 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:56:05,002 WARN L191 SmtUtils]: Spent 625.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-20 10:56:05,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:56:05,029 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:56:05,338 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-20 10:56:05,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:56:05,346 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:56:05,654 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-20 10:56:05,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:56:05,656 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:56:05,767 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-20 10:56:05,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:56:05,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 12 dim-0 vars, and 1 xjuncts. [2019-11-20 10:56:05,768 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:1513, output treesize:3832 [2019-11-20 10:56:14,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:56:14,391 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 10:56:14,394 INFO L168 Benchmark]: Toolchain (without parser) took 544964.42 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 346.0 MB). Free memory was 947.0 MB in the beginning and 877.2 MB in the end (delta: 69.9 MB). Peak memory consumption was 415.9 MB. Max. memory is 11.5 GB. [2019-11-20 10:56:14,395 INFO L168 Benchmark]: CDTParser took 0.33 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-11-20 10:56:14,395 INFO L168 Benchmark]: CACSL2BoogieTranslator took 976.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -213.7 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-11-20 10:56:14,395 INFO L168 Benchmark]: Boogie Procedure Inliner took 139.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:56:14,395 INFO L168 Benchmark]: Boogie Preprocessor took 117.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:56:14,396 INFO L168 Benchmark]: RCFGBuilder took 3069.51 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: 96.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. [2019-11-20 10:56:14,396 INFO L168 Benchmark]: TraceAbstraction took 540656.36 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 158.9 MB). Free memory was 1.1 GB in the beginning and 877.2 MB in the end (delta: 173.7 MB). Peak memory consumption was 332.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:56:14,397 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.33 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 976.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -213.7 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 139.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 117.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3069.51 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: 96.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 540656.36 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 158.9 MB). Free memory was 1.1 GB in the beginning and 877.2 MB in the end (delta: 173.7 MB). Peak memory consumption was 332.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...