./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8531c852aede4d90d76778a05ed8837cee15399 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8531c852aede4d90d76778a05ed8837cee15399 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 10:17:38,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:17:38,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:17:38,338 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:17:38,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:17:38,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:17:38,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:17:38,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:17:38,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:17:38,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:17:38,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:17:38,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:17:38,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:17:38,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:17:38,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:17:38,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:17:38,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:17:38,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:17:38,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:17:38,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:17:38,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:17:38,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:17:38,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:17:38,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:17:38,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:17:38,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:17:38,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:17:38,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:17:38,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:17:38,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:17:38,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:17:38,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:17:38,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:17:38,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:17:38,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:17:38,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:17:38,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:17:38,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:17:38,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:17:38,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:17:38,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:17:38,371 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 10:17:38,382 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:17:38,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:17:38,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:17:38,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:17:38,384 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:17:38,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:17:38,384 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:17:38,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:17:38,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:17:38,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:17:38,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:17:38,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:17:38,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:17:38,386 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:17:38,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:17:38,386 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:17:38,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:17:38,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:17:38,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:17:38,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:17:38,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:17:38,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:17:38,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:17:38,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:17:38,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:17:38,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 10:17:38,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 10:17:38,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:17:38,388 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_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8531c852aede4d90d76778a05ed8837cee15399 [2019-11-20 10:17:38,528 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:17:38,538 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:17:38,541 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:17:38,543 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:17:38,543 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:17:38,544 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-2.c [2019-11-20 10:17:38,606 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/data/f8adfd445/b9e820cb4f8942ce8ff2a2c95a2d98ce/FLAG3658b72bf [2019-11-20 10:17:39,193 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:17:39,196 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-2.c [2019-11-20 10:17:39,235 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/data/f8adfd445/b9e820cb4f8942ce8ff2a2c95a2d98ce/FLAG3658b72bf [2019-11-20 10:17:39,565 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/data/f8adfd445/b9e820cb4f8942ce8ff2a2c95a2d98ce [2019-11-20 10:17:39,568 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:17:39,569 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:17:39,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:17:39,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:17:39,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:17:39,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:17:39" (1/1) ... [2019-11-20 10:17:39,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@acdcc3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:39, skipping insertion in model container [2019-11-20 10:17:39,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:17:39" (1/1) ... [2019-11-20 10:17:39,581 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:17:39,641 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:17:40,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:17:40,132 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:17:40,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:17:40,329 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:17:40,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:40 WrapperNode [2019-11-20 10:17:40,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:17:40,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:17:40,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:17:40,331 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:17:40,339 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:17:40" (1/1) ... [2019-11-20 10:17:40,377 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:17:40" (1/1) ... [2019-11-20 10:17:40,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:17:40,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:17:40,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:17:40,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:17:40,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:40" (1/1) ... [2019-11-20 10:17:40,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:40" (1/1) ... [2019-11-20 10:17:40,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:40" (1/1) ... [2019-11-20 10:17:40,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:40" (1/1) ... [2019-11-20 10:17:40,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:40" (1/1) ... [2019-11-20 10:17:40,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:40" (1/1) ... [2019-11-20 10:17:40,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:40" (1/1) ... [2019-11-20 10:17:40,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:17:40,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:17:40,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:17:40,626 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:17:40,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:17:40,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 10:17:40,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 10:17:40,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 10:17:40,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 10:17:40,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 10:17:40,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 10:17:40,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:17:40,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:17:40,988 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 10:17:41,872 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 10:17:41,873 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 10:17:41,874 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:17:41,874 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 10:17:41,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:17:41 BoogieIcfgContainer [2019-11-20 10:17:41,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:17:41,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:17:41,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:17:41,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:17:41,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:17:39" (1/3) ... [2019-11-20 10:17:41,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e70a734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:17:41, skipping insertion in model container [2019-11-20 10:17:41,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:40" (2/3) ... [2019-11-20 10:17:41,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e70a734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:17:41, skipping insertion in model container [2019-11-20 10:17:41,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:17:41" (3/3) ... [2019-11-20 10:17:41,882 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-2.c [2019-11-20 10:17:41,894 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:17:41,902 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 10:17:41,917 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 10:17:41,947 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:17:41,947 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 10:17:41,947 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:17:41,947 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:17:41,947 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:17:41,947 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:17:41,947 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:17:41,948 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:17:41,964 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-20 10:17:41,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:17:41,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:41,972 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:41,973 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:41,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:41,977 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-11-20 10:17:41,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:41,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172852148] [2019-11-20 10:17:41,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:42,279 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:17:42,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172852148] [2019-11-20 10:17:42,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:42,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:42,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074527473] [2019-11-20 10:17:42,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:42,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:42,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:42,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:42,310 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-20 10:17:42,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:42,909 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2019-11-20 10:17:42,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:42,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-20 10:17:42,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:42,923 INFO L225 Difference]: With dead ends: 313 [2019-11-20 10:17:42,923 INFO L226 Difference]: Without dead ends: 158 [2019-11-20 10:17:42,927 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:17:42,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-20 10:17:42,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-20 10:17:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 10:17:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2019-11-20 10:17:42,978 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2019-11-20 10:17:42,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:42,979 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2019-11-20 10:17:42,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2019-11-20 10:17:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 10:17:42,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:42,983 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:42,983 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:42,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:42,984 INFO L82 PathProgramCache]: Analyzing trace with hash 968097209, now seen corresponding path program 1 times [2019-11-20 10:17:42,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:42,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419712832] [2019-11-20 10:17:42,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:43,114 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:17:43,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419712832] [2019-11-20 10:17:43,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:43,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:43,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387201982] [2019-11-20 10:17:43,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:43,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:43,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:43,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:43,119 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2019-11-20 10:17:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:43,572 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2019-11-20 10:17:43,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:43,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-20 10:17:43,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:43,575 INFO L225 Difference]: With dead ends: 280 [2019-11-20 10:17:43,575 INFO L226 Difference]: Without dead ends: 158 [2019-11-20 10:17:43,576 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:17:43,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-20 10:17:43,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-20 10:17:43,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 10:17:43,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2019-11-20 10:17:43,602 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2019-11-20 10:17:43,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:43,603 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2019-11-20 10:17:43,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:43,603 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2019-11-20 10:17:43,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 10:17:43,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:43,611 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:43,612 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:43,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:43,613 INFO L82 PathProgramCache]: Analyzing trace with hash -461266997, now seen corresponding path program 1 times [2019-11-20 10:17:43,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:43,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913974916] [2019-11-20 10:17:43,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:43,756 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:17:43,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913974916] [2019-11-20 10:17:43,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:43,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:43,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158725589] [2019-11-20 10:17:43,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:43,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:43,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:43,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:43,758 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2019-11-20 10:17:44,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:44,219 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2019-11-20 10:17:44,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:44,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 10:17:44,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:44,221 INFO L225 Difference]: With dead ends: 279 [2019-11-20 10:17:44,221 INFO L226 Difference]: Without dead ends: 157 [2019-11-20 10:17:44,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:17:44,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-20 10:17:44,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2019-11-20 10:17:44,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 10:17:44,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2019-11-20 10:17:44,243 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2019-11-20 10:17:44,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:44,251 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2019-11-20 10:17:44,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:44,252 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2019-11-20 10:17:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 10:17:44,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:44,254 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:44,254 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:44,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:44,255 INFO L82 PathProgramCache]: Analyzing trace with hash 881926454, now seen corresponding path program 1 times [2019-11-20 10:17:44,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:44,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742990099] [2019-11-20 10:17:44,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:44,375 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:17:44,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742990099] [2019-11-20 10:17:44,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:44,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:44,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664877845] [2019-11-20 10:17:44,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:44,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:44,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:44,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:44,377 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2019-11-20 10:17:44,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:44,727 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2019-11-20 10:17:44,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:44,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 10:17:44,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:44,729 INFO L225 Difference]: With dead ends: 277 [2019-11-20 10:17:44,730 INFO L226 Difference]: Without dead ends: 155 [2019-11-20 10:17:44,730 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:17:44,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-20 10:17:44,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2019-11-20 10:17:44,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 10:17:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2019-11-20 10:17:44,746 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2019-11-20 10:17:44,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:44,748 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2019-11-20 10:17:44,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:44,748 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2019-11-20 10:17:44,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 10:17:44,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:44,751 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:44,751 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:44,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:44,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1831274614, now seen corresponding path program 1 times [2019-11-20 10:17:44,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:44,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871660570] [2019-11-20 10:17:44,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:44,882 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:17:44,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871660570] [2019-11-20 10:17:44,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:44,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:44,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833895757] [2019-11-20 10:17:44,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:44,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:44,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:44,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:44,889 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2019-11-20 10:17:45,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:45,245 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2019-11-20 10:17:45,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:45,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 10:17:45,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:45,247 INFO L225 Difference]: With dead ends: 276 [2019-11-20 10:17:45,248 INFO L226 Difference]: Without dead ends: 154 [2019-11-20 10:17:45,248 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:17:45,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-20 10:17:45,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-20 10:17:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 10:17:45,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2019-11-20 10:17:45,257 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2019-11-20 10:17:45,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:45,257 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2019-11-20 10:17:45,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:45,257 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2019-11-20 10:17:45,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 10:17:45,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:45,259 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:45,259 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:45,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:45,259 INFO L82 PathProgramCache]: Analyzing trace with hash 376743775, now seen corresponding path program 1 times [2019-11-20 10:17:45,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:45,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997545174] [2019-11-20 10:17:45,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:45,316 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:17:45,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997545174] [2019-11-20 10:17:45,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:45,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:45,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456205312] [2019-11-20 10:17:45,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:45,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:45,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:45,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:45,319 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2019-11-20 10:17:45,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:45,672 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2019-11-20 10:17:45,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:45,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 10:17:45,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:45,674 INFO L225 Difference]: With dead ends: 276 [2019-11-20 10:17:45,675 INFO L226 Difference]: Without dead ends: 154 [2019-11-20 10:17:45,675 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:17:45,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-20 10:17:45,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-20 10:17:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 10:17:45,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2019-11-20 10:17:45,681 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2019-11-20 10:17:45,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:45,681 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2019-11-20 10:17:45,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:45,682 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2019-11-20 10:17:45,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 10:17:45,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:45,683 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:45,683 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:45,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:45,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1718254146, now seen corresponding path program 1 times [2019-11-20 10:17:45,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:45,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589842035] [2019-11-20 10:17:45,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:45,752 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:17:45,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589842035] [2019-11-20 10:17:45,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:45,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:45,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136447515] [2019-11-20 10:17:45,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:45,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:45,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:45,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:45,754 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2019-11-20 10:17:46,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:46,131 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2019-11-20 10:17:46,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:46,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-20 10:17:46,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:46,133 INFO L225 Difference]: With dead ends: 276 [2019-11-20 10:17:46,133 INFO L226 Difference]: Without dead ends: 154 [2019-11-20 10:17:46,133 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:17:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-20 10:17:46,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-20 10:17:46,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 10:17:46,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2019-11-20 10:17:46,139 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2019-11-20 10:17:46,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:46,139 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2019-11-20 10:17:46,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:46,139 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2019-11-20 10:17:46,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 10:17:46,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:46,140 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:46,140 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:46,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:46,141 INFO L82 PathProgramCache]: Analyzing trace with hash 316605892, now seen corresponding path program 1 times [2019-11-20 10:17:46,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:46,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854326937] [2019-11-20 10:17:46,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:46,202 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:17:46,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854326937] [2019-11-20 10:17:46,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:46,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:46,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985400568] [2019-11-20 10:17:46,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:46,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:46,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:46,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:46,204 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2019-11-20 10:17:46,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:46,520 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2019-11-20 10:17:46,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:46,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-20 10:17:46,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:46,521 INFO L225 Difference]: With dead ends: 276 [2019-11-20 10:17:46,521 INFO L226 Difference]: Without dead ends: 154 [2019-11-20 10:17:46,522 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:17:46,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-20 10:17:46,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-20 10:17:46,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 10:17:46,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2019-11-20 10:17:46,527 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2019-11-20 10:17:46,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:46,527 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2019-11-20 10:17:46,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:46,527 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2019-11-20 10:17:46,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-20 10:17:46,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:46,528 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:46,528 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:46,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:46,529 INFO L82 PathProgramCache]: Analyzing trace with hash -223613817, now seen corresponding path program 1 times [2019-11-20 10:17:46,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:46,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807013573] [2019-11-20 10:17:46,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:46,580 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:17:46,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807013573] [2019-11-20 10:17:46,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:46,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:46,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895826527] [2019-11-20 10:17:46,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:46,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:46,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:46,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:46,583 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2019-11-20 10:17:46,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:46,856 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2019-11-20 10:17:46,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:46,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-20 10:17:46,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:46,858 INFO L225 Difference]: With dead ends: 266 [2019-11-20 10:17:46,858 INFO L226 Difference]: Without dead ends: 144 [2019-11-20 10:17:46,858 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:17:46,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-20 10:17:46,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-11-20 10:17:46,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 10:17:46,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-11-20 10:17:46,863 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2019-11-20 10:17:46,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:46,863 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-11-20 10:17:46,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:46,864 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-11-20 10:17:46,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-20 10:17:46,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:46,864 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:46,865 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:46,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:46,868 INFO L82 PathProgramCache]: Analyzing trace with hash 176537583, now seen corresponding path program 1 times [2019-11-20 10:17:46,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:46,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566830680] [2019-11-20 10:17:46,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:46,940 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:17:46,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566830680] [2019-11-20 10:17:46,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:46,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:46,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724584902] [2019-11-20 10:17:46,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:46,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:46,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:46,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:46,946 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2019-11-20 10:17:47,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:47,336 INFO L93 Difference]: Finished difference Result 307 states and 462 transitions. [2019-11-20 10:17:47,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:47,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-20 10:17:47,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:47,339 INFO L225 Difference]: With dead ends: 307 [2019-11-20 10:17:47,339 INFO L226 Difference]: Without dead ends: 185 [2019-11-20 10:17:47,339 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:17:47,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-20 10:17:47,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 163. [2019-11-20 10:17:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 10:17:47,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2019-11-20 10:17:47,351 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2019-11-20 10:17:47,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:47,351 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2019-11-20 10:17:47,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:47,351 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2019-11-20 10:17:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 10:17:47,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:47,353 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:47,353 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:47,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:47,353 INFO L82 PathProgramCache]: Analyzing trace with hash 551995766, now seen corresponding path program 1 times [2019-11-20 10:17:47,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:47,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777563695] [2019-11-20 10:17:47,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:47,417 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:17:47,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777563695] [2019-11-20 10:17:47,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:47,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:47,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128315775] [2019-11-20 10:17:47,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:47,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:47,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:47,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:47,420 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2019-11-20 10:17:47,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:47,819 INFO L93 Difference]: Finished difference Result 329 states and 499 transitions. [2019-11-20 10:17:47,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:47,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-20 10:17:47,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:47,821 INFO L225 Difference]: With dead ends: 329 [2019-11-20 10:17:47,821 INFO L226 Difference]: Without dead ends: 185 [2019-11-20 10:17:47,822 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:17:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-20 10:17:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 163. [2019-11-20 10:17:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 10:17:47,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2019-11-20 10:17:47,827 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2019-11-20 10:17:47,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:47,828 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2019-11-20 10:17:47,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:47,828 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2019-11-20 10:17:47,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 10:17:47,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:47,829 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:47,829 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:47,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:47,829 INFO L82 PathProgramCache]: Analyzing trace with hash -475509842, now seen corresponding path program 1 times [2019-11-20 10:17:47,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:47,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415389465] [2019-11-20 10:17:47,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:47,875 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:17:47,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415389465] [2019-11-20 10:17:47,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:47,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:47,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28692977] [2019-11-20 10:17:47,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:47,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:47,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:47,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:47,882 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2019-11-20 10:17:48,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:48,266 INFO L93 Difference]: Finished difference Result 328 states and 496 transitions. [2019-11-20 10:17:48,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:48,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-20 10:17:48,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:48,268 INFO L225 Difference]: With dead ends: 328 [2019-11-20 10:17:48,269 INFO L226 Difference]: Without dead ends: 184 [2019-11-20 10:17:48,269 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:17:48,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-20 10:17:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-11-20 10:17:48,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 10:17:48,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2019-11-20 10:17:48,280 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2019-11-20 10:17:48,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:48,281 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2019-11-20 10:17:48,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2019-11-20 10:17:48,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 10:17:48,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:48,284 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:48,284 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:48,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:48,285 INFO L82 PathProgramCache]: Analyzing trace with hash 867683609, now seen corresponding path program 1 times [2019-11-20 10:17:48,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:48,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052895536] [2019-11-20 10:17:48,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:48,351 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:17:48,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052895536] [2019-11-20 10:17:48,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:48,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:48,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088610305] [2019-11-20 10:17:48,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:48,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:48,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:48,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:48,354 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2019-11-20 10:17:48,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:48,724 INFO L93 Difference]: Finished difference Result 326 states and 492 transitions. [2019-11-20 10:17:48,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:48,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-20 10:17:48,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:48,726 INFO L225 Difference]: With dead ends: 326 [2019-11-20 10:17:48,726 INFO L226 Difference]: Without dead ends: 182 [2019-11-20 10:17:48,727 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:17:48,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-20 10:17:48,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 163. [2019-11-20 10:17:48,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 10:17:48,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-11-20 10:17:48,736 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2019-11-20 10:17:48,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:48,737 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-11-20 10:17:48,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:48,737 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-11-20 10:17:48,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 10:17:48,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:48,739 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:48,739 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:48,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:48,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1817031769, now seen corresponding path program 1 times [2019-11-20 10:17:48,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:48,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912968273] [2019-11-20 10:17:48,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:48,805 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:17:48,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912968273] [2019-11-20 10:17:48,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:48,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:48,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782602970] [2019-11-20 10:17:48,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:48,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:48,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:48,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:48,808 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2019-11-20 10:17:49,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:49,267 INFO L93 Difference]: Finished difference Result 325 states and 489 transitions. [2019-11-20 10:17:49,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:49,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-20 10:17:49,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:49,270 INFO L225 Difference]: With dead ends: 325 [2019-11-20 10:17:49,270 INFO L226 Difference]: Without dead ends: 181 [2019-11-20 10:17:49,270 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:17:49,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-20 10:17:49,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-20 10:17:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 10:17:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-11-20 10:17:49,276 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2019-11-20 10:17:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:49,277 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-11-20 10:17:49,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:49,278 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-11-20 10:17:49,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 10:17:49,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:49,279 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:49,279 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:49,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:49,279 INFO L82 PathProgramCache]: Analyzing trace with hash 362500930, now seen corresponding path program 1 times [2019-11-20 10:17:49,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:49,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640372717] [2019-11-20 10:17:49,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:49,340 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:17:49,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640372717] [2019-11-20 10:17:49,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:49,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:49,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709954461] [2019-11-20 10:17:49,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:49,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:49,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:49,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:49,343 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2019-11-20 10:17:49,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:49,720 INFO L93 Difference]: Finished difference Result 325 states and 487 transitions. [2019-11-20 10:17:49,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:49,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-20 10:17:49,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:49,722 INFO L225 Difference]: With dead ends: 325 [2019-11-20 10:17:49,722 INFO L226 Difference]: Without dead ends: 181 [2019-11-20 10:17:49,722 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:17:49,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-20 10:17:49,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-20 10:17:49,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 10:17:49,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2019-11-20 10:17:49,727 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2019-11-20 10:17:49,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:49,727 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2019-11-20 10:17:49,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:49,728 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2019-11-20 10:17:49,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 10:17:49,728 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:49,729 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:49,731 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:49,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:49,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1276725951, now seen corresponding path program 1 times [2019-11-20 10:17:49,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:49,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457815297] [2019-11-20 10:17:49,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:49,780 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:17:49,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457815297] [2019-11-20 10:17:49,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:49,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:49,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067712424] [2019-11-20 10:17:49,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:49,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:49,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:49,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:49,784 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2019-11-20 10:17:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:50,146 INFO L93 Difference]: Finished difference Result 325 states and 485 transitions. [2019-11-20 10:17:50,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:50,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-20 10:17:50,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:50,148 INFO L225 Difference]: With dead ends: 325 [2019-11-20 10:17:50,148 INFO L226 Difference]: Without dead ends: 181 [2019-11-20 10:17:50,148 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:17:50,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-20 10:17:50,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-20 10:17:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 10:17:50,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2019-11-20 10:17:50,159 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2019-11-20 10:17:50,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:50,160 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2019-11-20 10:17:50,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:50,160 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2019-11-20 10:17:50,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-20 10:17:50,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:50,161 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:50,161 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:50,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:50,162 INFO L82 PathProgramCache]: Analyzing trace with hash -485866265, now seen corresponding path program 1 times [2019-11-20 10:17:50,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:50,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746243828] [2019-11-20 10:17:50,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:50,207 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:17:50,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746243828] [2019-11-20 10:17:50,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:50,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:50,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298254229] [2019-11-20 10:17:50,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:50,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:50,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:50,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:50,208 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2019-11-20 10:17:50,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:50,512 INFO L93 Difference]: Finished difference Result 325 states and 483 transitions. [2019-11-20 10:17:50,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:50,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-20 10:17:50,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:50,514 INFO L225 Difference]: With dead ends: 325 [2019-11-20 10:17:50,514 INFO L226 Difference]: Without dead ends: 181 [2019-11-20 10:17:50,515 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:17:50,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-20 10:17:50,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-20 10:17:50,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 10:17:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2019-11-20 10:17:50,520 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2019-11-20 10:17:50,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:50,520 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2019-11-20 10:17:50,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:50,520 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2019-11-20 10:17:50,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-20 10:17:50,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:50,522 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:50,523 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:50,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:50,523 INFO L82 PathProgramCache]: Analyzing trace with hash 669553092, now seen corresponding path program 1 times [2019-11-20 10:17:50,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:50,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605309620] [2019-11-20 10:17:50,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:50,578 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:17:50,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605309620] [2019-11-20 10:17:50,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:50,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:50,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432003282] [2019-11-20 10:17:50,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:50,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:50,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:50,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:50,580 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2019-11-20 10:17:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:50,861 INFO L93 Difference]: Finished difference Result 315 states and 468 transitions. [2019-11-20 10:17:50,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:50,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-20 10:17:50,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:50,863 INFO L225 Difference]: With dead ends: 315 [2019-11-20 10:17:50,863 INFO L226 Difference]: Without dead ends: 171 [2019-11-20 10:17:50,863 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:17:50,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-20 10:17:50,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 163. [2019-11-20 10:17:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 10:17:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2019-11-20 10:17:50,868 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2019-11-20 10:17:50,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:50,868 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2019-11-20 10:17:50,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2019-11-20 10:17:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 10:17:50,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:50,869 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:50,870 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:50,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:50,870 INFO L82 PathProgramCache]: Analyzing trace with hash 719124867, now seen corresponding path program 1 times [2019-11-20 10:17:50,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:50,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627341503] [2019-11-20 10:17:50,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:50,946 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:17:50,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627341503] [2019-11-20 10:17:50,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:50,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:50,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916292311] [2019-11-20 10:17:50,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:50,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:50,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:50,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:50,948 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2019-11-20 10:17:51,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:51,357 INFO L93 Difference]: Finished difference Result 403 states and 603 transitions. [2019-11-20 10:17:51,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:51,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-20 10:17:51,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:51,359 INFO L225 Difference]: With dead ends: 403 [2019-11-20 10:17:51,359 INFO L226 Difference]: Without dead ends: 259 [2019-11-20 10:17:51,360 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:17:51,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-20 10:17:51,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 206. [2019-11-20 10:17:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-20 10:17:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2019-11-20 10:17:51,366 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2019-11-20 10:17:51,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:51,367 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2019-11-20 10:17:51,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:51,367 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2019-11-20 10:17:51,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 10:17:51,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:51,368 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:51,368 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:51,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:51,368 INFO L82 PathProgramCache]: Analyzing trace with hash -178268411, now seen corresponding path program 1 times [2019-11-20 10:17:51,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:51,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675384060] [2019-11-20 10:17:51,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:51,456 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:17:51,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675384060] [2019-11-20 10:17:51,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:51,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:51,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506016354] [2019-11-20 10:17:51,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:51,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:51,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:51,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:51,460 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2019-11-20 10:17:51,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:51,900 INFO L93 Difference]: Finished difference Result 443 states and 687 transitions. [2019-11-20 10:17:51,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:51,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-20 10:17:51,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:51,902 INFO L225 Difference]: With dead ends: 443 [2019-11-20 10:17:51,902 INFO L226 Difference]: Without dead ends: 256 [2019-11-20 10:17:51,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:17:51,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-20 10:17:51,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 230. [2019-11-20 10:17:51,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-20 10:17:51,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2019-11-20 10:17:51,910 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2019-11-20 10:17:51,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:51,910 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2019-11-20 10:17:51,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:51,910 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2019-11-20 10:17:51,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 10:17:51,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:51,912 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:51,912 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:51,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:51,912 INFO L82 PathProgramCache]: Analyzing trace with hash 2081210466, now seen corresponding path program 1 times [2019-11-20 10:17:51,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:51,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447985253] [2019-11-20 10:17:51,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:51,974 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:17:51,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447985253] [2019-11-20 10:17:51,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:51,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:51,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597488361] [2019-11-20 10:17:51,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:51,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:51,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:51,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:51,976 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2019-11-20 10:17:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:52,472 INFO L93 Difference]: Finished difference Result 494 states and 764 transitions. [2019-11-20 10:17:52,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:52,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 10:17:52,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:52,475 INFO L225 Difference]: With dead ends: 494 [2019-11-20 10:17:52,475 INFO L226 Difference]: Without dead ends: 283 [2019-11-20 10:17:52,475 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:17:52,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-20 10:17:52,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 230. [2019-11-20 10:17:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-20 10:17:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2019-11-20 10:17:52,484 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2019-11-20 10:17:52,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:52,484 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2019-11-20 10:17:52,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:52,484 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2019-11-20 10:17:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 10:17:52,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:52,486 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:52,486 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:52,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:52,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2121885216, now seen corresponding path program 1 times [2019-11-20 10:17:52,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:52,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65316604] [2019-11-20 10:17:52,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:52,549 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:17:52,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65316604] [2019-11-20 10:17:52,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:52,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:52,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604587330] [2019-11-20 10:17:52,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:52,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:52,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:52,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:52,551 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2019-11-20 10:17:52,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:52,889 INFO L93 Difference]: Finished difference Result 467 states and 726 transitions. [2019-11-20 10:17:52,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:52,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 10:17:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:52,893 INFO L225 Difference]: With dead ends: 467 [2019-11-20 10:17:52,893 INFO L226 Difference]: Without dead ends: 256 [2019-11-20 10:17:52,894 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:17:52,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-20 10:17:52,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 230. [2019-11-20 10:17:52,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-20 10:17:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2019-11-20 10:17:52,902 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2019-11-20 10:17:52,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:52,902 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2019-11-20 10:17:52,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:52,903 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2019-11-20 10:17:52,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 10:17:52,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:52,904 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:52,904 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:52,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:52,905 INFO L82 PathProgramCache]: Analyzing trace with hash -314494398, now seen corresponding path program 1 times [2019-11-20 10:17:52,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:52,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361546876] [2019-11-20 10:17:52,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:52,965 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:17:52,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361546876] [2019-11-20 10:17:52,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:52,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:52,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161913092] [2019-11-20 10:17:52,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:52,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:52,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:52,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:52,968 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2019-11-20 10:17:53,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:53,320 INFO L93 Difference]: Finished difference Result 493 states and 759 transitions. [2019-11-20 10:17:53,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:53,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 10:17:53,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:53,322 INFO L225 Difference]: With dead ends: 493 [2019-11-20 10:17:53,322 INFO L226 Difference]: Without dead ends: 282 [2019-11-20 10:17:53,323 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:17:53,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-20 10:17:53,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2019-11-20 10:17:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-20 10:17:53,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2019-11-20 10:17:53,329 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2019-11-20 10:17:53,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:53,329 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2019-11-20 10:17:53,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:53,329 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2019-11-20 10:17:53,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 10:17:53,330 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:53,331 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:53,331 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:53,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:53,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1028699053, now seen corresponding path program 1 times [2019-11-20 10:17:53,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:53,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357704232] [2019-11-20 10:17:53,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:53,392 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:17:53,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357704232] [2019-11-20 10:17:53,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:53,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:53,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798145644] [2019-11-20 10:17:53,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:53,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:53,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:53,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:53,394 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2019-11-20 10:17:53,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:53,850 INFO L93 Difference]: Finished difference Result 491 states and 755 transitions. [2019-11-20 10:17:53,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:53,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 10:17:53,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:53,852 INFO L225 Difference]: With dead ends: 491 [2019-11-20 10:17:53,852 INFO L226 Difference]: Without dead ends: 280 [2019-11-20 10:17:53,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:17:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-20 10:17:53,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 230. [2019-11-20 10:17:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-20 10:17:53,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2019-11-20 10:17:53,860 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2019-11-20 10:17:53,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:53,860 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2019-11-20 10:17:53,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:53,861 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2019-11-20 10:17:53,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 10:17:53,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:53,862 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:53,862 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:53,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:53,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1978047213, now seen corresponding path program 1 times [2019-11-20 10:17:53,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:53,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440833596] [2019-11-20 10:17:53,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:53,928 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:17:53,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440833596] [2019-11-20 10:17:53,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:53,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:53,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063521279] [2019-11-20 10:17:53,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:53,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:53,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:53,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:53,930 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2019-11-20 10:17:54,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:54,285 INFO L93 Difference]: Finished difference Result 490 states and 752 transitions. [2019-11-20 10:17:54,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:54,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 10:17:54,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:54,287 INFO L225 Difference]: With dead ends: 490 [2019-11-20 10:17:54,288 INFO L226 Difference]: Without dead ends: 279 [2019-11-20 10:17:54,288 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:17:54,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-20 10:17:54,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2019-11-20 10:17:54,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-20 10:17:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2019-11-20 10:17:54,294 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2019-11-20 10:17:54,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:54,294 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2019-11-20 10:17:54,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2019-11-20 10:17:54,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 10:17:54,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:54,295 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:54,295 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:54,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:54,296 INFO L82 PathProgramCache]: Analyzing trace with hash 523516374, now seen corresponding path program 1 times [2019-11-20 10:17:54,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:54,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377608345] [2019-11-20 10:17:54,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:54,373 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:17:54,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377608345] [2019-11-20 10:17:54,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:54,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 10:17:54,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443033762] [2019-11-20 10:17:54,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:17:54,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:54,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:17:54,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:17:54,375 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2019-11-20 10:17:54,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:54,841 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2019-11-20 10:17:54,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:17:54,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-11-20 10:17:54,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:54,842 INFO L225 Difference]: With dead ends: 462 [2019-11-20 10:17:54,843 INFO L226 Difference]: Without dead ends: 251 [2019-11-20 10:17:54,843 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:17:54,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-20 10:17:54,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-11-20 10:17:54,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 10:17:54,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2019-11-20 10:17:54,849 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2019-11-20 10:17:54,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:54,850 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2019-11-20 10:17:54,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:17:54,850 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2019-11-20 10:17:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 10:17:54,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:54,851 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:54,852 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:54,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:54,852 INFO L82 PathProgramCache]: Analyzing trace with hash -2005350993, now seen corresponding path program 1 times [2019-11-20 10:17:54,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:54,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914241839] [2019-11-20 10:17:54,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:54,931 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:17:54,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914241839] [2019-11-20 10:17:54,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:54,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:54,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435513166] [2019-11-20 10:17:54,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:54,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:54,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:54,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:54,933 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2019-11-20 10:17:55,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:55,350 INFO L93 Difference]: Finished difference Result 504 states and 766 transitions. [2019-11-20 10:17:55,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:55,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 10:17:55,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:55,353 INFO L225 Difference]: With dead ends: 504 [2019-11-20 10:17:55,353 INFO L226 Difference]: Without dead ends: 273 [2019-11-20 10:17:55,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:17:55,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-20 10:17:55,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 250. [2019-11-20 10:17:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 10:17:55,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2019-11-20 10:17:55,364 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2019-11-20 10:17:55,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:55,365 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2019-11-20 10:17:55,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:55,365 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2019-11-20 10:17:55,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 10:17:55,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:55,366 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:55,367 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:55,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:55,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1056002833, now seen corresponding path program 1 times [2019-11-20 10:17:55,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:55,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964309768] [2019-11-20 10:17:55,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:55,431 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:17:55,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964309768] [2019-11-20 10:17:55,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:55,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:55,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993921062] [2019-11-20 10:17:55,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:55,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:55,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:55,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:55,433 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2019-11-20 10:17:55,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:55,853 INFO L93 Difference]: Finished difference Result 503 states and 763 transitions. [2019-11-20 10:17:55,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:55,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 10:17:55,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:55,855 INFO L225 Difference]: With dead ends: 503 [2019-11-20 10:17:55,855 INFO L226 Difference]: Without dead ends: 272 [2019-11-20 10:17:55,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:17:55,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-20 10:17:55,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-20 10:17:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 10:17:55,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2019-11-20 10:17:55,863 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2019-11-20 10:17:55,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:55,863 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2019-11-20 10:17:55,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:55,864 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2019-11-20 10:17:55,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 10:17:55,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:55,865 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:55,865 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:55,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:55,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1449434210, now seen corresponding path program 1 times [2019-11-20 10:17:55,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:55,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744511880] [2019-11-20 10:17:55,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:55,923 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:17:55,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744511880] [2019-11-20 10:17:55,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:55,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:55,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770827032] [2019-11-20 10:17:55,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:55,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:55,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:55,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:55,925 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2019-11-20 10:17:56,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:56,388 INFO L93 Difference]: Finished difference Result 530 states and 797 transitions. [2019-11-20 10:17:56,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:56,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-20 10:17:56,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:56,390 INFO L225 Difference]: With dead ends: 530 [2019-11-20 10:17:56,390 INFO L226 Difference]: Without dead ends: 299 [2019-11-20 10:17:56,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:17:56,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-20 10:17:56,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-20 10:17:56,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 10:17:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2019-11-20 10:17:56,399 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2019-11-20 10:17:56,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:56,399 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2019-11-20 10:17:56,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:56,399 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2019-11-20 10:17:56,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 10:17:56,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:56,400 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:56,400 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:56,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:56,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1015705124, now seen corresponding path program 1 times [2019-11-20 10:17:56,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:56,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461003396] [2019-11-20 10:17:56,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:56,453 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:17:56,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461003396] [2019-11-20 10:17:56,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:56,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:56,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7630775] [2019-11-20 10:17:56,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:56,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:56,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:56,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:56,456 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2019-11-20 10:17:56,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:56,850 INFO L93 Difference]: Finished difference Result 503 states and 759 transitions. [2019-11-20 10:17:56,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:56,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-20 10:17:56,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:56,852 INFO L225 Difference]: With dead ends: 503 [2019-11-20 10:17:56,852 INFO L226 Difference]: Without dead ends: 272 [2019-11-20 10:17:56,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:17:56,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-20 10:17:56,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-20 10:17:56,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 10:17:56,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2019-11-20 10:17:56,860 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2019-11-20 10:17:56,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:56,861 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2019-11-20 10:17:56,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:56,861 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2019-11-20 10:17:56,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 10:17:56,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:56,862 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:56,862 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:56,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:56,863 INFO L82 PathProgramCache]: Analyzing trace with hash 542245225, now seen corresponding path program 1 times [2019-11-20 10:17:56,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:56,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780558218] [2019-11-20 10:17:56,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:56,950 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:17:56,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780558218] [2019-11-20 10:17:56,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:56,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:56,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133311085] [2019-11-20 10:17:56,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:56,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:56,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:56,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:56,952 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2019-11-20 10:17:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:57,405 INFO L93 Difference]: Finished difference Result 530 states and 793 transitions. [2019-11-20 10:17:57,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:57,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-20 10:17:57,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:57,407 INFO L225 Difference]: With dead ends: 530 [2019-11-20 10:17:57,408 INFO L226 Difference]: Without dead ends: 299 [2019-11-20 10:17:57,408 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:17:57,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-20 10:17:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-20 10:17:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 10:17:57,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2019-11-20 10:17:57,416 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2019-11-20 10:17:57,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:57,416 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2019-11-20 10:17:57,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2019-11-20 10:17:57,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 10:17:57,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:57,418 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:57,418 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:57,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:57,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1102945003, now seen corresponding path program 1 times [2019-11-20 10:17:57,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:57,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264060639] [2019-11-20 10:17:57,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:57,473 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:17:57,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264060639] [2019-11-20 10:17:57,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:57,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:57,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554793377] [2019-11-20 10:17:57,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:57,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:57,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:57,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:57,475 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2019-11-20 10:17:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:57,840 INFO L93 Difference]: Finished difference Result 503 states and 755 transitions. [2019-11-20 10:17:57,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:57,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-20 10:17:57,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:57,842 INFO L225 Difference]: With dead ends: 503 [2019-11-20 10:17:57,842 INFO L226 Difference]: Without dead ends: 272 [2019-11-20 10:17:57,843 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:17:57,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-20 10:17:57,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-20 10:17:57,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 10:17:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2019-11-20 10:17:57,851 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2019-11-20 10:17:57,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:57,852 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2019-11-20 10:17:57,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:57,852 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2019-11-20 10:17:57,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 10:17:57,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:57,853 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:57,853 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:57,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:57,854 INFO L82 PathProgramCache]: Analyzing trace with hash 952064921, now seen corresponding path program 1 times [2019-11-20 10:17:57,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:57,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276702092] [2019-11-20 10:17:57,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:57,907 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:17:57,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276702092] [2019-11-20 10:17:57,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:57,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:57,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662720471] [2019-11-20 10:17:57,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:57,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:57,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:57,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:57,908 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2019-11-20 10:17:58,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:58,392 INFO L93 Difference]: Finished difference Result 530 states and 789 transitions. [2019-11-20 10:17:58,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:58,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-20 10:17:58,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:58,394 INFO L225 Difference]: With dead ends: 530 [2019-11-20 10:17:58,394 INFO L226 Difference]: Without dead ends: 299 [2019-11-20 10:17:58,395 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:17:58,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-20 10:17:58,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-20 10:17:58,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 10:17:58,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2019-11-20 10:17:58,404 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2019-11-20 10:17:58,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:58,404 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2019-11-20 10:17:58,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:58,404 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2019-11-20 10:17:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 10:17:58,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:58,405 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:58,406 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:58,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:58,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1153888855, now seen corresponding path program 1 times [2019-11-20 10:17:58,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:58,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223297349] [2019-11-20 10:17:58,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:58,461 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:17:58,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223297349] [2019-11-20 10:17:58,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:58,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:58,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385753334] [2019-11-20 10:17:58,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:58,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:58,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:58,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:58,463 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2019-11-20 10:17:58,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:58,779 INFO L93 Difference]: Finished difference Result 503 states and 751 transitions. [2019-11-20 10:17:58,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:58,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-20 10:17:58,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:58,780 INFO L225 Difference]: With dead ends: 503 [2019-11-20 10:17:58,780 INFO L226 Difference]: Without dead ends: 272 [2019-11-20 10:17:58,781 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:17:58,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-20 10:17:58,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-20 10:17:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 10:17:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2019-11-20 10:17:58,788 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2019-11-20 10:17:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:58,788 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2019-11-20 10:17:58,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2019-11-20 10:17:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 10:17:58,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:58,790 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:58,790 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:58,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:58,790 INFO L82 PathProgramCache]: Analyzing trace with hash -431127036, now seen corresponding path program 1 times [2019-11-20 10:17:58,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:58,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000606783] [2019-11-20 10:17:58,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:58,851 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:17:58,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000606783] [2019-11-20 10:17:58,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:58,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:58,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024493104] [2019-11-20 10:17:58,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:58,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:58,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:58,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:58,853 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2019-11-20 10:17:59,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:59,246 INFO L93 Difference]: Finished difference Result 520 states and 773 transitions. [2019-11-20 10:17:59,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:59,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-20 10:17:59,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:59,248 INFO L225 Difference]: With dead ends: 520 [2019-11-20 10:17:59,248 INFO L226 Difference]: Without dead ends: 289 [2019-11-20 10:17:59,248 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:17:59,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-20 10:17:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-11-20 10:17:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 10:17:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2019-11-20 10:17:59,256 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2019-11-20 10:17:59,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:59,257 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2019-11-20 10:17:59,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:59,257 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2019-11-20 10:17:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 10:17:59,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:59,258 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:59,258 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:59,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:59,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1530447622, now seen corresponding path program 1 times [2019-11-20 10:17:59,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:59,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213807964] [2019-11-20 10:17:59,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:59,316 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:17:59,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213807964] [2019-11-20 10:17:59,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:59,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:59,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364455455] [2019-11-20 10:17:59,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:59,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:59,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:59,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:59,318 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2019-11-20 10:17:59,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:17:59,700 INFO L93 Difference]: Finished difference Result 493 states and 735 transitions. [2019-11-20 10:17:59,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:17:59,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-20 10:17:59,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:17:59,702 INFO L225 Difference]: With dead ends: 493 [2019-11-20 10:17:59,702 INFO L226 Difference]: Without dead ends: 262 [2019-11-20 10:17:59,703 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:17:59,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-20 10:17:59,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 250. [2019-11-20 10:17:59,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 10:17:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2019-11-20 10:17:59,711 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2019-11-20 10:17:59,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:17:59,711 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2019-11-20 10:17:59,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:17:59,711 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2019-11-20 10:17:59,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 10:17:59,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:17:59,713 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:17:59,713 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:17:59,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:17:59,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1853395595, now seen corresponding path program 1 times [2019-11-20 10:17:59,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:17:59,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5687741] [2019-11-20 10:17:59,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:17:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:17:59,784 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:17:59,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5687741] [2019-11-20 10:17:59,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:17:59,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:17:59,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792432121] [2019-11-20 10:17:59,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:17:59,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:17:59,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:17:59,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:17:59,787 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2019-11-20 10:18:00,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:00,148 INFO L93 Difference]: Finished difference Result 520 states and 769 transitions. [2019-11-20 10:18:00,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:00,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-20 10:18:00,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:00,150 INFO L225 Difference]: With dead ends: 520 [2019-11-20 10:18:00,150 INFO L226 Difference]: Without dead ends: 289 [2019-11-20 10:18:00,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:18:00,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-20 10:18:00,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-11-20 10:18:00,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 10:18:00,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2019-11-20 10:18:00,158 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2019-11-20 10:18:00,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:00,158 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2019-11-20 10:18:00,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:00,159 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2019-11-20 10:18:00,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 10:18:00,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:00,160 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:00,160 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:00,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:00,160 INFO L82 PathProgramCache]: Analyzing trace with hash 167215757, now seen corresponding path program 1 times [2019-11-20 10:18:00,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:00,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734610169] [2019-11-20 10:18:00,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-20 10:18:00,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734610169] [2019-11-20 10:18:00,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:00,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:18:00,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058790026] [2019-11-20 10:18:00,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:18:00,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:00,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:18:00,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:18:00,221 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2019-11-20 10:18:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:00,262 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2019-11-20 10:18:00,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:18:00,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-20 10:18:00,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:00,265 INFO L225 Difference]: With dead ends: 710 [2019-11-20 10:18:00,265 INFO L226 Difference]: Without dead ends: 479 [2019-11-20 10:18:00,266 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:18:00,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-20 10:18:00,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-11-20 10:18:00,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-11-20 10:18:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 711 transitions. [2019-11-20 10:18:00,279 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 711 transitions. Word has length 106 [2019-11-20 10:18:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:00,279 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 711 transitions. [2019-11-20 10:18:00,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:18:00,280 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 711 transitions. [2019-11-20 10:18:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-20 10:18:00,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:00,281 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, 2, 1, 1, 1, 1, 1, 1, 1, 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:18:00,282 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:00,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:00,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1381936186, now seen corresponding path program 1 times [2019-11-20 10:18:00,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:00,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768286108] [2019-11-20 10:18:00,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:18:00,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768286108] [2019-11-20 10:18:00,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:00,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:18:00,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492098094] [2019-11-20 10:18:00,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:18:00,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:00,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:18:00,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:18:00,348 INFO L87 Difference]: Start difference. First operand 479 states and 711 transitions. Second operand 3 states. [2019-11-20 10:18:00,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:00,389 INFO L93 Difference]: Finished difference Result 710 states and 1057 transitions. [2019-11-20 10:18:00,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:18:00,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-20 10:18:00,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:00,394 INFO L225 Difference]: With dead ends: 710 [2019-11-20 10:18:00,394 INFO L226 Difference]: Without dead ends: 708 [2019-11-20 10:18:00,394 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:18:00,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-11-20 10:18:00,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2019-11-20 10:18:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-11-20 10:18:00,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1055 transitions. [2019-11-20 10:18:00,415 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1055 transitions. Word has length 125 [2019-11-20 10:18:00,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:00,415 INFO L462 AbstractCegarLoop]: Abstraction has 708 states and 1055 transitions. [2019-11-20 10:18:00,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:18:00,416 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1055 transitions. [2019-11-20 10:18:00,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 10:18:00,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:00,418 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:00,418 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:00,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:00,418 INFO L82 PathProgramCache]: Analyzing trace with hash -921484902, now seen corresponding path program 1 times [2019-11-20 10:18:00,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:00,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782187135] [2019-11-20 10:18:00,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-11-20 10:18:00,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782187135] [2019-11-20 10:18:00,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:00,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:00,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198847179] [2019-11-20 10:18:00,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:00,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:00,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:00,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:00,506 INFO L87 Difference]: Start difference. First operand 708 states and 1055 transitions. Second operand 4 states. [2019-11-20 10:18:01,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:01,035 INFO L93 Difference]: Finished difference Result 1696 states and 2545 transitions. [2019-11-20 10:18:01,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:01,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-11-20 10:18:01,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:01,041 INFO L225 Difference]: With dead ends: 1696 [2019-11-20 10:18:01,041 INFO L226 Difference]: Without dead ends: 1007 [2019-11-20 10:18:01,043 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:18:01,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-11-20 10:18:01,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 774. [2019-11-20 10:18:01,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-11-20 10:18:01,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1166 transitions. [2019-11-20 10:18:01,068 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1166 transitions. Word has length 170 [2019-11-20 10:18:01,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:01,069 INFO L462 AbstractCegarLoop]: Abstraction has 774 states and 1166 transitions. [2019-11-20 10:18:01,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1166 transitions. [2019-11-20 10:18:01,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-20 10:18:01,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:01,072 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:01,072 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:01,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:01,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1322898733, now seen corresponding path program 1 times [2019-11-20 10:18:01,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:01,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631352244] [2019-11-20 10:18:01,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-11-20 10:18:01,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631352244] [2019-11-20 10:18:01,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:01,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:01,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963216133] [2019-11-20 10:18:01,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:01,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:01,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:01,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:01,156 INFO L87 Difference]: Start difference. First operand 774 states and 1166 transitions. Second operand 4 states. [2019-11-20 10:18:01,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:01,815 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2019-11-20 10:18:01,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:01,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-11-20 10:18:01,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:01,821 INFO L225 Difference]: With dead ends: 1747 [2019-11-20 10:18:01,821 INFO L226 Difference]: Without dead ends: 992 [2019-11-20 10:18:01,823 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:18:01,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-11-20 10:18:01,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 777. [2019-11-20 10:18:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-11-20 10:18:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1169 transitions. [2019-11-20 10:18:01,854 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1169 transitions. Word has length 171 [2019-11-20 10:18:01,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:01,855 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1169 transitions. [2019-11-20 10:18:01,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:01,855 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1169 transitions. [2019-11-20 10:18:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-20 10:18:01,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:01,859 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:01,859 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:01,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:01,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1032298903, now seen corresponding path program 1 times [2019-11-20 10:18:01,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:01,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487946633] [2019-11-20 10:18:01,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:01,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487946633] [2019-11-20 10:18:01,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:01,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:01,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709186421] [2019-11-20 10:18:01,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:01,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:01,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:01,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:01,965 INFO L87 Difference]: Start difference. First operand 777 states and 1169 transitions. Second operand 4 states. [2019-11-20 10:18:02,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:02,563 INFO L93 Difference]: Finished difference Result 1750 states and 2630 transitions. [2019-11-20 10:18:02,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:02,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-11-20 10:18:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:02,569 INFO L225 Difference]: With dead ends: 1750 [2019-11-20 10:18:02,569 INFO L226 Difference]: Without dead ends: 992 [2019-11-20 10:18:02,570 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:18:02,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-11-20 10:18:02,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 777. [2019-11-20 10:18:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-11-20 10:18:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1166 transitions. [2019-11-20 10:18:02,592 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1166 transitions. Word has length 183 [2019-11-20 10:18:02,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:02,593 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1166 transitions. [2019-11-20 10:18:02,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:02,593 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1166 transitions. [2019-11-20 10:18:02,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-20 10:18:02,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:02,595 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:02,596 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:02,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:02,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2029168624, now seen corresponding path program 1 times [2019-11-20 10:18:02,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:02,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017557228] [2019-11-20 10:18:02,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:02,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017557228] [2019-11-20 10:18:02,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:02,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:02,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812097412] [2019-11-20 10:18:02,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:02,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:02,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:02,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:02,701 INFO L87 Difference]: Start difference. First operand 777 states and 1166 transitions. Second operand 4 states. [2019-11-20 10:18:03,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:03,221 INFO L93 Difference]: Finished difference Result 1744 states and 2618 transitions. [2019-11-20 10:18:03,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:03,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-11-20 10:18:03,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:03,227 INFO L225 Difference]: With dead ends: 1744 [2019-11-20 10:18:03,227 INFO L226 Difference]: Without dead ends: 986 [2019-11-20 10:18:03,228 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:18:03,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2019-11-20 10:18:03,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 777. [2019-11-20 10:18:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-11-20 10:18:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1163 transitions. [2019-11-20 10:18:03,251 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1163 transitions. Word has length 184 [2019-11-20 10:18:03,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:03,252 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1163 transitions. [2019-11-20 10:18:03,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1163 transitions. [2019-11-20 10:18:03,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-20 10:18:03,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:03,255 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:03,255 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:03,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:03,256 INFO L82 PathProgramCache]: Analyzing trace with hash -315914064, now seen corresponding path program 1 times [2019-11-20 10:18:03,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:03,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679679580] [2019-11-20 10:18:03,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-20 10:18:03,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679679580] [2019-11-20 10:18:03,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:03,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:03,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487166744] [2019-11-20 10:18:03,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:03,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:03,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:03,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:03,333 INFO L87 Difference]: Start difference. First operand 777 states and 1163 transitions. Second operand 4 states. [2019-11-20 10:18:03,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:03,812 INFO L93 Difference]: Finished difference Result 1834 states and 2761 transitions. [2019-11-20 10:18:03,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:03,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-11-20 10:18:03,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:03,817 INFO L225 Difference]: With dead ends: 1834 [2019-11-20 10:18:03,817 INFO L226 Difference]: Without dead ends: 1076 [2019-11-20 10:18:03,818 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:18:03,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-11-20 10:18:03,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 843. [2019-11-20 10:18:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2019-11-20 10:18:03,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1274 transitions. [2019-11-20 10:18:03,843 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1274 transitions. Word has length 184 [2019-11-20 10:18:03,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:03,844 INFO L462 AbstractCegarLoop]: Abstraction has 843 states and 1274 transitions. [2019-11-20 10:18:03,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:03,844 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1274 transitions. [2019-11-20 10:18:03,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-20 10:18:03,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:03,846 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:03,847 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:03,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:03,847 INFO L82 PathProgramCache]: Analyzing trace with hash 269928061, now seen corresponding path program 1 times [2019-11-20 10:18:03,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:03,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856975249] [2019-11-20 10:18:03,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-20 10:18:03,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856975249] [2019-11-20 10:18:03,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:03,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:03,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488186935] [2019-11-20 10:18:03,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:03,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:03,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:03,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:03,953 INFO L87 Difference]: Start difference. First operand 843 states and 1274 transitions. Second operand 4 states. [2019-11-20 10:18:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:04,394 INFO L93 Difference]: Finished difference Result 1885 states and 2846 transitions. [2019-11-20 10:18:04,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:04,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-20 10:18:04,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:04,402 INFO L225 Difference]: With dead ends: 1885 [2019-11-20 10:18:04,402 INFO L226 Difference]: Without dead ends: 1061 [2019-11-20 10:18:04,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:18:04,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-11-20 10:18:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 828. [2019-11-20 10:18:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-11-20 10:18:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1247 transitions. [2019-11-20 10:18:04,428 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1247 transitions. Word has length 185 [2019-11-20 10:18:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:04,428 INFO L462 AbstractCegarLoop]: Abstraction has 828 states and 1247 transitions. [2019-11-20 10:18:04,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1247 transitions. [2019-11-20 10:18:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-20 10:18:04,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:04,431 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:04,431 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:04,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:04,432 INFO L82 PathProgramCache]: Analyzing trace with hash -2013811987, now seen corresponding path program 1 times [2019-11-20 10:18:04,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:04,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61510665] [2019-11-20 10:18:04,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:04,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61510665] [2019-11-20 10:18:04,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:04,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:04,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595132701] [2019-11-20 10:18:04,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:04,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:04,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:04,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:04,511 INFO L87 Difference]: Start difference. First operand 828 states and 1247 transitions. Second operand 4 states. [2019-11-20 10:18:04,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:04,920 INFO L93 Difference]: Finished difference Result 1864 states and 2810 transitions. [2019-11-20 10:18:04,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:04,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-20 10:18:04,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:04,927 INFO L225 Difference]: With dead ends: 1864 [2019-11-20 10:18:04,927 INFO L226 Difference]: Without dead ends: 1055 [2019-11-20 10:18:04,928 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:18:04,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2019-11-20 10:18:04,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 828. [2019-11-20 10:18:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-11-20 10:18:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1244 transitions. [2019-11-20 10:18:04,958 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1244 transitions. Word has length 185 [2019-11-20 10:18:04,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:04,958 INFO L462 AbstractCegarLoop]: Abstraction has 828 states and 1244 transitions. [2019-11-20 10:18:04,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:04,958 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1244 transitions. [2019-11-20 10:18:04,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-20 10:18:04,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:04,961 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:04,962 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:04,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:04,962 INFO L82 PathProgramCache]: Analyzing trace with hash 592864628, now seen corresponding path program 1 times [2019-11-20 10:18:04,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:04,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180709581] [2019-11-20 10:18:04,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:05,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180709581] [2019-11-20 10:18:05,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:05,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:05,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495784667] [2019-11-20 10:18:05,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:05,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:05,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:05,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:05,081 INFO L87 Difference]: Start difference. First operand 828 states and 1244 transitions. Second operand 4 states. [2019-11-20 10:18:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:05,520 INFO L93 Difference]: Finished difference Result 1864 states and 2804 transitions. [2019-11-20 10:18:05,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:05,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-20 10:18:05,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:05,526 INFO L225 Difference]: With dead ends: 1864 [2019-11-20 10:18:05,526 INFO L226 Difference]: Without dead ends: 1055 [2019-11-20 10:18:05,526 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:18:05,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2019-11-20 10:18:05,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 828. [2019-11-20 10:18:05,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-11-20 10:18:05,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1241 transitions. [2019-11-20 10:18:05,551 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1241 transitions. Word has length 186 [2019-11-20 10:18:05,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:05,552 INFO L462 AbstractCegarLoop]: Abstraction has 828 states and 1241 transitions. [2019-11-20 10:18:05,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:05,552 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1241 transitions. [2019-11-20 10:18:05,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-20 10:18:05,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:05,555 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:05,555 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:05,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:05,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1121043182, now seen corresponding path program 1 times [2019-11-20 10:18:05,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:05,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716614035] [2019-11-20 10:18:05,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:05,632 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:05,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716614035] [2019-11-20 10:18:05,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:05,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:05,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097103100] [2019-11-20 10:18:05,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:05,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:05,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:05,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:05,634 INFO L87 Difference]: Start difference. First operand 828 states and 1241 transitions. Second operand 4 states. [2019-11-20 10:18:06,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:06,118 INFO L93 Difference]: Finished difference Result 1864 states and 2798 transitions. [2019-11-20 10:18:06,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:06,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-11-20 10:18:06,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:06,126 INFO L225 Difference]: With dead ends: 1864 [2019-11-20 10:18:06,127 INFO L226 Difference]: Without dead ends: 1055 [2019-11-20 10:18:06,127 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:18:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2019-11-20 10:18:06,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 828. [2019-11-20 10:18:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-11-20 10:18:06,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1238 transitions. [2019-11-20 10:18:06,151 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1238 transitions. Word has length 187 [2019-11-20 10:18:06,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:06,152 INFO L462 AbstractCegarLoop]: Abstraction has 828 states and 1238 transitions. [2019-11-20 10:18:06,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:06,152 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1238 transitions. [2019-11-20 10:18:06,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-20 10:18:06,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:06,155 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:06,155 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:06,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:06,155 INFO L82 PathProgramCache]: Analyzing trace with hash 216285873, now seen corresponding path program 1 times [2019-11-20 10:18:06,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:06,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324199998] [2019-11-20 10:18:06,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:06,242 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:06,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324199998] [2019-11-20 10:18:06,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:06,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:06,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269451323] [2019-11-20 10:18:06,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:06,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:06,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:06,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:06,244 INFO L87 Difference]: Start difference. First operand 828 states and 1238 transitions. Second operand 4 states. [2019-11-20 10:18:06,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:06,635 INFO L93 Difference]: Finished difference Result 1864 states and 2792 transitions. [2019-11-20 10:18:06,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:06,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-11-20 10:18:06,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:06,639 INFO L225 Difference]: With dead ends: 1864 [2019-11-20 10:18:06,640 INFO L226 Difference]: Without dead ends: 1055 [2019-11-20 10:18:06,640 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:18:06,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2019-11-20 10:18:06,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 834. [2019-11-20 10:18:06,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2019-11-20 10:18:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1247 transitions. [2019-11-20 10:18:06,663 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1247 transitions. Word has length 187 [2019-11-20 10:18:06,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:06,664 INFO L462 AbstractCegarLoop]: Abstraction has 834 states and 1247 transitions. [2019-11-20 10:18:06,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:06,664 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1247 transitions. [2019-11-20 10:18:06,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-20 10:18:06,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:06,667 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:06,667 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:06,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:06,667 INFO L82 PathProgramCache]: Analyzing trace with hash 665885305, now seen corresponding path program 1 times [2019-11-20 10:18:06,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:06,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929463217] [2019-11-20 10:18:06,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:06,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929463217] [2019-11-20 10:18:06,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:06,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:06,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282911512] [2019-11-20 10:18:06,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:06,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:06,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:06,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:06,748 INFO L87 Difference]: Start difference. First operand 834 states and 1247 transitions. Second operand 4 states. [2019-11-20 10:18:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:07,154 INFO L93 Difference]: Finished difference Result 1840 states and 2762 transitions. [2019-11-20 10:18:07,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:07,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-11-20 10:18:07,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:07,159 INFO L225 Difference]: With dead ends: 1840 [2019-11-20 10:18:07,159 INFO L226 Difference]: Without dead ends: 1025 [2019-11-20 10:18:07,160 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:18:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2019-11-20 10:18:07,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 834. [2019-11-20 10:18:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2019-11-20 10:18:07,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1244 transitions. [2019-11-20 10:18:07,184 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1244 transitions. Word has length 188 [2019-11-20 10:18:07,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:07,185 INFO L462 AbstractCegarLoop]: Abstraction has 834 states and 1244 transitions. [2019-11-20 10:18:07,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:07,185 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1244 transitions. [2019-11-20 10:18:07,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-20 10:18:07,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:07,187 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:07,187 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:07,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:07,188 INFO L82 PathProgramCache]: Analyzing trace with hash -188075789, now seen corresponding path program 1 times [2019-11-20 10:18:07,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:07,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391679895] [2019-11-20 10:18:07,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:07,314 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:07,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391679895] [2019-11-20 10:18:07,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:07,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:07,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396085042] [2019-11-20 10:18:07,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:07,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:07,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:07,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:07,316 INFO L87 Difference]: Start difference. First operand 834 states and 1244 transitions. Second operand 4 states. [2019-11-20 10:18:07,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:07,921 INFO L93 Difference]: Finished difference Result 1840 states and 2756 transitions. [2019-11-20 10:18:07,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:07,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-11-20 10:18:07,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:07,928 INFO L225 Difference]: With dead ends: 1840 [2019-11-20 10:18:07,928 INFO L226 Difference]: Without dead ends: 1025 [2019-11-20 10:18:07,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:18:07,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2019-11-20 10:18:07,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 837. [2019-11-20 10:18:07,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-11-20 10:18:07,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1247 transitions. [2019-11-20 10:18:07,958 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1247 transitions. Word has length 188 [2019-11-20 10:18:07,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:07,960 INFO L462 AbstractCegarLoop]: Abstraction has 837 states and 1247 transitions. [2019-11-20 10:18:07,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:07,960 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1247 transitions. [2019-11-20 10:18:07,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-20 10:18:07,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:07,963 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:07,963 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:07,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:07,964 INFO L82 PathProgramCache]: Analyzing trace with hash 559305356, now seen corresponding path program 1 times [2019-11-20 10:18:07,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:07,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638792342] [2019-11-20 10:18:07,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:08,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638792342] [2019-11-20 10:18:08,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:08,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:08,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028904427] [2019-11-20 10:18:08,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:08,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:08,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:08,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:08,062 INFO L87 Difference]: Start difference. First operand 837 states and 1247 transitions. Second operand 4 states. [2019-11-20 10:18:08,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:08,667 INFO L93 Difference]: Finished difference Result 1834 states and 2744 transitions. [2019-11-20 10:18:08,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:08,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-11-20 10:18:08,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:08,673 INFO L225 Difference]: With dead ends: 1834 [2019-11-20 10:18:08,673 INFO L226 Difference]: Without dead ends: 1016 [2019-11-20 10:18:08,674 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:18:08,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-11-20 10:18:08,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 840. [2019-11-20 10:18:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-11-20 10:18:08,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1250 transitions. [2019-11-20 10:18:08,698 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1250 transitions. Word has length 189 [2019-11-20 10:18:08,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:08,699 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1250 transitions. [2019-11-20 10:18:08,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1250 transitions. [2019-11-20 10:18:08,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-20 10:18:08,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:08,701 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:08,701 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:08,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:08,702 INFO L82 PathProgramCache]: Analyzing trace with hash 178479314, now seen corresponding path program 2 times [2019-11-20 10:18:08,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:08,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215273794] [2019-11-20 10:18:08,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-11-20 10:18:08,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215273794] [2019-11-20 10:18:08,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:08,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:08,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328042302] [2019-11-20 10:18:08,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:08,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:08,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:08,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:08,785 INFO L87 Difference]: Start difference. First operand 840 states and 1250 transitions. Second operand 4 states. [2019-11-20 10:18:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:09,283 INFO L93 Difference]: Finished difference Result 1837 states and 2744 transitions. [2019-11-20 10:18:09,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:09,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-20 10:18:09,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:09,287 INFO L225 Difference]: With dead ends: 1837 [2019-11-20 10:18:09,288 INFO L226 Difference]: Without dead ends: 1016 [2019-11-20 10:18:09,288 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:18:09,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-11-20 10:18:09,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 849. [2019-11-20 10:18:09,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-11-20 10:18:09,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1259 transitions. [2019-11-20 10:18:09,313 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1259 transitions. Word has length 192 [2019-11-20 10:18:09,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:09,314 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1259 transitions. [2019-11-20 10:18:09,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:09,314 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1259 transitions. [2019-11-20 10:18:09,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 10:18:09,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:09,316 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:09,316 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:09,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:09,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1497734315, now seen corresponding path program 1 times [2019-11-20 10:18:09,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:09,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458802236] [2019-11-20 10:18:09,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:09,398 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-11-20 10:18:09,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458802236] [2019-11-20 10:18:09,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:09,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:09,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426323538] [2019-11-20 10:18:09,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:09,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:09,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:09,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:09,400 INFO L87 Difference]: Start difference. First operand 849 states and 1259 transitions. Second operand 4 states. [2019-11-20 10:18:09,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:09,748 INFO L93 Difference]: Finished difference Result 1834 states and 2735 transitions. [2019-11-20 10:18:09,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:09,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-20 10:18:09,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:09,760 INFO L225 Difference]: With dead ends: 1834 [2019-11-20 10:18:09,760 INFO L226 Difference]: Without dead ends: 1004 [2019-11-20 10:18:09,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:18:09,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-11-20 10:18:09,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 852. [2019-11-20 10:18:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-11-20 10:18:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1262 transitions. [2019-11-20 10:18:09,778 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1262 transitions. Word has length 193 [2019-11-20 10:18:09,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:09,779 INFO L462 AbstractCegarLoop]: Abstraction has 852 states and 1262 transitions. [2019-11-20 10:18:09,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1262 transitions. [2019-11-20 10:18:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-20 10:18:09,780 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:09,780 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:09,780 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:09,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:09,781 INFO L82 PathProgramCache]: Analyzing trace with hash 2027842374, now seen corresponding path program 1 times [2019-11-20 10:18:09,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:09,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675343827] [2019-11-20 10:18:09,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 10:18:09,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675343827] [2019-11-20 10:18:09,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:09,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:09,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636229807] [2019-11-20 10:18:09,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:09,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:09,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:09,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:09,897 INFO L87 Difference]: Start difference. First operand 852 states and 1262 transitions. Second operand 4 states. [2019-11-20 10:18:10,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:10,543 INFO L93 Difference]: Finished difference Result 1984 states and 2959 transitions. [2019-11-20 10:18:10,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:10,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-11-20 10:18:10,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:10,558 INFO L225 Difference]: With dead ends: 1984 [2019-11-20 10:18:10,558 INFO L226 Difference]: Without dead ends: 1151 [2019-11-20 10:18:10,559 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:18:10,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-11-20 10:18:10,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 918. [2019-11-20 10:18:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2019-11-20 10:18:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1373 transitions. [2019-11-20 10:18:10,593 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1373 transitions. Word has length 195 [2019-11-20 10:18:10,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:10,594 INFO L462 AbstractCegarLoop]: Abstraction has 918 states and 1373 transitions. [2019-11-20 10:18:10,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:10,594 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1373 transitions. [2019-11-20 10:18:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-20 10:18:10,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:10,598 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:10,598 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:10,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:10,599 INFO L82 PathProgramCache]: Analyzing trace with hash -88066393, now seen corresponding path program 1 times [2019-11-20 10:18:10,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:10,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319836892] [2019-11-20 10:18:10,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-20 10:18:10,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319836892] [2019-11-20 10:18:10,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:10,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:10,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170455889] [2019-11-20 10:18:10,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:10,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:10,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:10,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:10,686 INFO L87 Difference]: Start difference. First operand 918 states and 1373 transitions. Second operand 4 states. [2019-11-20 10:18:11,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:11,110 INFO L93 Difference]: Finished difference Result 1969 states and 2957 transitions. [2019-11-20 10:18:11,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:11,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2019-11-20 10:18:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:11,112 INFO L225 Difference]: With dead ends: 1969 [2019-11-20 10:18:11,112 INFO L226 Difference]: Without dead ends: 1070 [2019-11-20 10:18:11,113 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:18:11,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2019-11-20 10:18:11,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 927. [2019-11-20 10:18:11,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-11-20 10:18:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1388 transitions. [2019-11-20 10:18:11,137 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1388 transitions. Word has length 196 [2019-11-20 10:18:11,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:11,138 INFO L462 AbstractCegarLoop]: Abstraction has 927 states and 1388 transitions. [2019-11-20 10:18:11,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:11,138 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1388 transitions. [2019-11-20 10:18:11,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-20 10:18:11,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:11,140 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:11,140 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:11,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:11,141 INFO L82 PathProgramCache]: Analyzing trace with hash -245708013, now seen corresponding path program 1 times [2019-11-20 10:18:11,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:11,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925883861] [2019-11-20 10:18:11,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-20 10:18:11,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925883861] [2019-11-20 10:18:11,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:11,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:11,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341708695] [2019-11-20 10:18:11,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:11,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:11,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:11,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:11,225 INFO L87 Difference]: Start difference. First operand 927 states and 1388 transitions. Second operand 4 states. [2019-11-20 10:18:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:11,619 INFO L93 Difference]: Finished difference Result 2050 states and 3068 transitions. [2019-11-20 10:18:11,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:11,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-11-20 10:18:11,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:11,621 INFO L225 Difference]: With dead ends: 2050 [2019-11-20 10:18:11,622 INFO L226 Difference]: Without dead ends: 1142 [2019-11-20 10:18:11,622 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:18:11,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2019-11-20 10:18:11,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 927. [2019-11-20 10:18:11,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-11-20 10:18:11,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1385 transitions. [2019-11-20 10:18:11,646 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1385 transitions. Word has length 197 [2019-11-20 10:18:11,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:11,646 INFO L462 AbstractCegarLoop]: Abstraction has 927 states and 1385 transitions. [2019-11-20 10:18:11,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:11,646 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1385 transitions. [2019-11-20 10:18:11,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-20 10:18:11,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:11,647 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:11,648 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:11,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:11,648 INFO L82 PathProgramCache]: Analyzing trace with hash -496931648, now seen corresponding path program 1 times [2019-11-20 10:18:11,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:11,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801989739] [2019-11-20 10:18:11,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:11,733 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-20 10:18:11,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801989739] [2019-11-20 10:18:11,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:11,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:11,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133213600] [2019-11-20 10:18:11,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:11,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:11,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:11,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:11,735 INFO L87 Difference]: Start difference. First operand 927 states and 1385 transitions. Second operand 4 states. [2019-11-20 10:18:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:12,073 INFO L93 Difference]: Finished difference Result 1954 states and 2924 transitions. [2019-11-20 10:18:12,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:12,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-11-20 10:18:12,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:12,075 INFO L225 Difference]: With dead ends: 1954 [2019-11-20 10:18:12,075 INFO L226 Difference]: Without dead ends: 1046 [2019-11-20 10:18:12,076 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:18:12,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-11-20 10:18:12,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 930. [2019-11-20 10:18:12,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-11-20 10:18:12,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1388 transitions. [2019-11-20 10:18:12,101 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1388 transitions. Word has length 197 [2019-11-20 10:18:12,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:12,101 INFO L462 AbstractCegarLoop]: Abstraction has 930 states and 1388 transitions. [2019-11-20 10:18:12,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:12,101 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1388 transitions. [2019-11-20 10:18:12,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-20 10:18:12,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:12,104 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:12,104 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:12,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:12,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1904041172, now seen corresponding path program 1 times [2019-11-20 10:18:12,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:12,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793876548] [2019-11-20 10:18:12,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:12,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793876548] [2019-11-20 10:18:12,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:12,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:12,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809396933] [2019-11-20 10:18:12,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:12,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:12,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:12,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:12,189 INFO L87 Difference]: Start difference. First operand 930 states and 1388 transitions. Second operand 4 states. [2019-11-20 10:18:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:12,670 INFO L93 Difference]: Finished difference Result 1957 states and 2924 transitions. [2019-11-20 10:18:12,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:12,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-11-20 10:18:12,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:12,672 INFO L225 Difference]: With dead ends: 1957 [2019-11-20 10:18:12,672 INFO L226 Difference]: Without dead ends: 1046 [2019-11-20 10:18:12,673 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:18:12,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-11-20 10:18:12,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 933. [2019-11-20 10:18:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2019-11-20 10:18:12,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1391 transitions. [2019-11-20 10:18:12,694 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1391 transitions. Word has length 197 [2019-11-20 10:18:12,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:12,694 INFO L462 AbstractCegarLoop]: Abstraction has 933 states and 1391 transitions. [2019-11-20 10:18:12,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:12,694 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1391 transitions. [2019-11-20 10:18:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-20 10:18:12,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:12,695 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:12,696 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:12,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:12,696 INFO L82 PathProgramCache]: Analyzing trace with hash 643682438, now seen corresponding path program 1 times [2019-11-20 10:18:12,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:12,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622315963] [2019-11-20 10:18:12,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-20 10:18:12,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622315963] [2019-11-20 10:18:12,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:12,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:12,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190981195] [2019-11-20 10:18:12,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:12,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:12,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:12,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:12,776 INFO L87 Difference]: Start difference. First operand 933 states and 1391 transitions. Second operand 4 states. [2019-11-20 10:18:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:13,129 INFO L93 Difference]: Finished difference Result 2056 states and 3068 transitions. [2019-11-20 10:18:13,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:13,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-11-20 10:18:13,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:13,131 INFO L225 Difference]: With dead ends: 2056 [2019-11-20 10:18:13,131 INFO L226 Difference]: Without dead ends: 1142 [2019-11-20 10:18:13,132 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:18:13,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2019-11-20 10:18:13,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 933. [2019-11-20 10:18:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2019-11-20 10:18:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1388 transitions. [2019-11-20 10:18:13,159 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1388 transitions. Word has length 198 [2019-11-20 10:18:13,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:13,159 INFO L462 AbstractCegarLoop]: Abstraction has 933 states and 1388 transitions. [2019-11-20 10:18:13,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1388 transitions. [2019-11-20 10:18:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-20 10:18:13,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:13,161 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:18:13,161 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:13,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:13,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1284262237, now seen corresponding path program 1 times [2019-11-20 10:18:13,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:13,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029532496] [2019-11-20 10:18:13,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:13,253 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:13,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029532496] [2019-11-20 10:18:13,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:13,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:13,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519087987] [2019-11-20 10:18:13,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:13,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:13,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:13,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:13,255 INFO L87 Difference]: Start difference. First operand 933 states and 1388 transitions. Second operand 4 states. [2019-11-20 10:18:13,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:13,588 INFO L93 Difference]: Finished difference Result 1960 states and 2918 transitions. [2019-11-20 10:18:13,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:13,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-11-20 10:18:13,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:13,591 INFO L225 Difference]: With dead ends: 1960 [2019-11-20 10:18:13,591 INFO L226 Difference]: Without dead ends: 1046 [2019-11-20 10:18:13,592 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:18:13,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-11-20 10:18:13,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 933. [2019-11-20 10:18:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2019-11-20 10:18:13,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1385 transitions. [2019-11-20 10:18:13,622 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1385 transitions. Word has length 198 [2019-11-20 10:18:13,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:13,622 INFO L462 AbstractCegarLoop]: Abstraction has 933 states and 1385 transitions. [2019-11-20 10:18:13,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:13,623 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1385 transitions. [2019-11-20 10:18:13,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-20 10:18:13,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:13,625 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:13,625 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:13,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:13,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1071861971, now seen corresponding path program 1 times [2019-11-20 10:18:13,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:13,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555085777] [2019-11-20 10:18:13,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:13,725 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:13,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555085777] [2019-11-20 10:18:13,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:13,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:13,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221692648] [2019-11-20 10:18:13,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:13,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:13,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:13,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:13,727 INFO L87 Difference]: Start difference. First operand 933 states and 1385 transitions. Second operand 4 states. [2019-11-20 10:18:14,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:14,130 INFO L93 Difference]: Finished difference Result 1954 states and 2906 transitions. [2019-11-20 10:18:14,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:14,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-11-20 10:18:14,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:14,133 INFO L225 Difference]: With dead ends: 1954 [2019-11-20 10:18:14,134 INFO L226 Difference]: Without dead ends: 1040 [2019-11-20 10:18:14,135 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:18:14,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-11-20 10:18:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 936. [2019-11-20 10:18:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2019-11-20 10:18:14,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1388 transitions. [2019-11-20 10:18:14,170 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1388 transitions. Word has length 198 [2019-11-20 10:18:14,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:14,170 INFO L462 AbstractCegarLoop]: Abstraction has 936 states and 1388 transitions. [2019-11-20 10:18:14,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:14,170 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1388 transitions. [2019-11-20 10:18:14,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-20 10:18:14,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:14,173 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:14,173 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:14,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:14,174 INFO L82 PathProgramCache]: Analyzing trace with hash -2014210793, now seen corresponding path program 1 times [2019-11-20 10:18:14,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:14,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777168937] [2019-11-20 10:18:14,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:14,268 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-20 10:18:14,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777168937] [2019-11-20 10:18:14,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:14,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:14,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337284712] [2019-11-20 10:18:14,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:14,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:14,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:14,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:14,271 INFO L87 Difference]: Start difference. First operand 936 states and 1388 transitions. Second operand 4 states. [2019-11-20 10:18:14,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:14,756 INFO L93 Difference]: Finished difference Result 2062 states and 3062 transitions. [2019-11-20 10:18:14,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:14,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-11-20 10:18:14,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:14,758 INFO L225 Difference]: With dead ends: 2062 [2019-11-20 10:18:14,758 INFO L226 Difference]: Without dead ends: 1145 [2019-11-20 10:18:14,759 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:18:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2019-11-20 10:18:14,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 936. [2019-11-20 10:18:14,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2019-11-20 10:18:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1385 transitions. [2019-11-20 10:18:14,778 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1385 transitions. Word has length 199 [2019-11-20 10:18:14,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:14,778 INFO L462 AbstractCegarLoop]: Abstraction has 936 states and 1385 transitions. [2019-11-20 10:18:14,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1385 transitions. [2019-11-20 10:18:14,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-20 10:18:14,780 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:14,780 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:14,780 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:14,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:14,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1486799318, now seen corresponding path program 1 times [2019-11-20 10:18:14,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:14,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596850128] [2019-11-20 10:18:14,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:14,873 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:14,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596850128] [2019-11-20 10:18:14,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:14,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:14,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270358586] [2019-11-20 10:18:14,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:14,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:14,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:14,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:14,875 INFO L87 Difference]: Start difference. First operand 936 states and 1385 transitions. Second operand 4 states. [2019-11-20 10:18:15,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:15,319 INFO L93 Difference]: Finished difference Result 1951 states and 2891 transitions. [2019-11-20 10:18:15,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:15,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-11-20 10:18:15,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:15,322 INFO L225 Difference]: With dead ends: 1951 [2019-11-20 10:18:15,323 INFO L226 Difference]: Without dead ends: 1034 [2019-11-20 10:18:15,324 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:18:15,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2019-11-20 10:18:15,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 936. [2019-11-20 10:18:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2019-11-20 10:18:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1382 transitions. [2019-11-20 10:18:15,353 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1382 transitions. Word has length 199 [2019-11-20 10:18:15,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:15,353 INFO L462 AbstractCegarLoop]: Abstraction has 936 states and 1382 transitions. [2019-11-20 10:18:15,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:15,354 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1382 transitions. [2019-11-20 10:18:15,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-20 10:18:15,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:15,356 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:15,356 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:15,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:15,356 INFO L82 PathProgramCache]: Analyzing trace with hash 172785486, now seen corresponding path program 1 times [2019-11-20 10:18:15,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:15,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023821536] [2019-11-20 10:18:15,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:15,435 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:15,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023821536] [2019-11-20 10:18:15,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:15,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:15,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945941741] [2019-11-20 10:18:15,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:15,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:15,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:15,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:15,437 INFO L87 Difference]: Start difference. First operand 936 states and 1382 transitions. Second operand 4 states. [2019-11-20 10:18:15,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:15,742 INFO L93 Difference]: Finished difference Result 1942 states and 2873 transitions. [2019-11-20 10:18:15,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:15,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-11-20 10:18:15,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:15,744 INFO L225 Difference]: With dead ends: 1942 [2019-11-20 10:18:15,744 INFO L226 Difference]: Without dead ends: 1025 [2019-11-20 10:18:15,744 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:18:15,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2019-11-20 10:18:15,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 939. [2019-11-20 10:18:15,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2019-11-20 10:18:15,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1385 transitions. [2019-11-20 10:18:15,765 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1385 transitions. Word has length 199 [2019-11-20 10:18:15,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:15,765 INFO L462 AbstractCegarLoop]: Abstraction has 939 states and 1385 transitions. [2019-11-20 10:18:15,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:15,765 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1385 transitions. [2019-11-20 10:18:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-20 10:18:15,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:15,766 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:15,767 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:15,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:15,767 INFO L82 PathProgramCache]: Analyzing trace with hash 580501642, now seen corresponding path program 1 times [2019-11-20 10:18:15,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:15,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255248278] [2019-11-20 10:18:15,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-20 10:18:15,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255248278] [2019-11-20 10:18:15,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:15,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:15,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868028505] [2019-11-20 10:18:15,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:15,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:15,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:15,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:15,839 INFO L87 Difference]: Start difference. First operand 939 states and 1385 transitions. Second operand 4 states. [2019-11-20 10:18:16,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:16,202 INFO L93 Difference]: Finished difference Result 2068 states and 3056 transitions. [2019-11-20 10:18:16,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:16,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-11-20 10:18:16,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:16,204 INFO L225 Difference]: With dead ends: 2068 [2019-11-20 10:18:16,204 INFO L226 Difference]: Without dead ends: 1148 [2019-11-20 10:18:16,205 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:18:16,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-11-20 10:18:16,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 939. [2019-11-20 10:18:16,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2019-11-20 10:18:16,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1382 transitions. [2019-11-20 10:18:16,226 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1382 transitions. Word has length 200 [2019-11-20 10:18:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:16,226 INFO L462 AbstractCegarLoop]: Abstraction has 939 states and 1382 transitions. [2019-11-20 10:18:16,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:16,226 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1382 transitions. [2019-11-20 10:18:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-20 10:18:16,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:16,227 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:16,228 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:16,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:16,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1504295748, now seen corresponding path program 1 times [2019-11-20 10:18:16,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:16,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427192623] [2019-11-20 10:18:16,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:16,303 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-20 10:18:16,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427192623] [2019-11-20 10:18:16,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:16,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:16,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018713816] [2019-11-20 10:18:16,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:16,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:16,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:16,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:16,305 INFO L87 Difference]: Start difference. First operand 939 states and 1382 transitions. Second operand 4 states. [2019-11-20 10:18:16,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:16,680 INFO L93 Difference]: Finished difference Result 2068 states and 3050 transitions. [2019-11-20 10:18:16,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:16,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-11-20 10:18:16,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:16,681 INFO L225 Difference]: With dead ends: 2068 [2019-11-20 10:18:16,681 INFO L226 Difference]: Without dead ends: 1148 [2019-11-20 10:18:16,682 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:18:16,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-11-20 10:18:16,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 939. [2019-11-20 10:18:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2019-11-20 10:18:16,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1379 transitions. [2019-11-20 10:18:16,707 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1379 transitions. Word has length 201 [2019-11-20 10:18:16,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:16,707 INFO L462 AbstractCegarLoop]: Abstraction has 939 states and 1379 transitions. [2019-11-20 10:18:16,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1379 transitions. [2019-11-20 10:18:16,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-20 10:18:16,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:16,709 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:16,709 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:16,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:16,709 INFO L82 PathProgramCache]: Analyzing trace with hash -166966693, now seen corresponding path program 1 times [2019-11-20 10:18:16,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:16,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379105649] [2019-11-20 10:18:16,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-20 10:18:16,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379105649] [2019-11-20 10:18:16,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:16,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:16,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286818764] [2019-11-20 10:18:16,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:16,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:16,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:16,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:16,778 INFO L87 Difference]: Start difference. First operand 939 states and 1379 transitions. Second operand 4 states. [2019-11-20 10:18:17,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:17,141 INFO L93 Difference]: Finished difference Result 2068 states and 3044 transitions. [2019-11-20 10:18:17,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:17,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-11-20 10:18:17,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:17,142 INFO L225 Difference]: With dead ends: 2068 [2019-11-20 10:18:17,142 INFO L226 Difference]: Without dead ends: 1148 [2019-11-20 10:18:17,143 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:18:17,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-11-20 10:18:17,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 939. [2019-11-20 10:18:17,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2019-11-20 10:18:17,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1376 transitions. [2019-11-20 10:18:17,165 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1376 transitions. Word has length 201 [2019-11-20 10:18:17,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:17,165 INFO L462 AbstractCegarLoop]: Abstraction has 939 states and 1376 transitions. [2019-11-20 10:18:17,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:17,165 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1376 transitions. [2019-11-20 10:18:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-20 10:18:17,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:17,167 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:17,167 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:17,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:17,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1953842574, now seen corresponding path program 1 times [2019-11-20 10:18:17,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:17,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564996941] [2019-11-20 10:18:17,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:17,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564996941] [2019-11-20 10:18:17,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:17,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:17,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10794353] [2019-11-20 10:18:17,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:17,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:17,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:17,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:17,251 INFO L87 Difference]: Start difference. First operand 939 states and 1376 transitions. Second operand 4 states. [2019-11-20 10:18:17,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:17,614 INFO L93 Difference]: Finished difference Result 1945 states and 2855 transitions. [2019-11-20 10:18:17,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:17,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-11-20 10:18:17,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:17,616 INFO L225 Difference]: With dead ends: 1945 [2019-11-20 10:18:17,616 INFO L226 Difference]: Without dead ends: 1025 [2019-11-20 10:18:17,617 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:18:17,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2019-11-20 10:18:17,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 942. [2019-11-20 10:18:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2019-11-20 10:18:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1379 transitions. [2019-11-20 10:18:17,638 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1379 transitions. Word has length 201 [2019-11-20 10:18:17,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:17,638 INFO L462 AbstractCegarLoop]: Abstraction has 942 states and 1379 transitions. [2019-11-20 10:18:17,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:17,638 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1379 transitions. [2019-11-20 10:18:17,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-20 10:18:17,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:17,640 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:17,640 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:17,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:17,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1669957647, now seen corresponding path program 1 times [2019-11-20 10:18:17,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:17,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538876440] [2019-11-20 10:18:17,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-20 10:18:17,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538876440] [2019-11-20 10:18:17,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:17,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:17,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194157523] [2019-11-20 10:18:17,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:17,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:17,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:17,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:17,717 INFO L87 Difference]: Start difference. First operand 942 states and 1379 transitions. Second operand 4 states. [2019-11-20 10:18:18,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:18,115 INFO L93 Difference]: Finished difference Result 2044 states and 3008 transitions. [2019-11-20 10:18:18,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:18,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-11-20 10:18:18,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:18,117 INFO L225 Difference]: With dead ends: 2044 [2019-11-20 10:18:18,117 INFO L226 Difference]: Without dead ends: 1121 [2019-11-20 10:18:18,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:18:18,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2019-11-20 10:18:18,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 942. [2019-11-20 10:18:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2019-11-20 10:18:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1376 transitions. [2019-11-20 10:18:18,151 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1376 transitions. Word has length 202 [2019-11-20 10:18:18,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:18,152 INFO L462 AbstractCegarLoop]: Abstraction has 942 states and 1376 transitions. [2019-11-20 10:18:18,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:18,152 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1376 transitions. [2019-11-20 10:18:18,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-20 10:18:18,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:18,154 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:18,154 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:18,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:18,155 INFO L82 PathProgramCache]: Analyzing trace with hash 815996553, now seen corresponding path program 1 times [2019-11-20 10:18:18,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:18,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431109411] [2019-11-20 10:18:18,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-20 10:18:18,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431109411] [2019-11-20 10:18:18,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:18,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:18,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393909504] [2019-11-20 10:18:18,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:18,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:18,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:18,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:18,235 INFO L87 Difference]: Start difference. First operand 942 states and 1376 transitions. Second operand 4 states. [2019-11-20 10:18:18,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:18,621 INFO L93 Difference]: Finished difference Result 2044 states and 3002 transitions. [2019-11-20 10:18:18,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:18,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-11-20 10:18:18,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:18,623 INFO L225 Difference]: With dead ends: 2044 [2019-11-20 10:18:18,623 INFO L226 Difference]: Without dead ends: 1121 [2019-11-20 10:18:18,624 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:18:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2019-11-20 10:18:18,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 942. [2019-11-20 10:18:18,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2019-11-20 10:18:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1373 transitions. [2019-11-20 10:18:18,647 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1373 transitions. Word has length 202 [2019-11-20 10:18:18,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:18,647 INFO L462 AbstractCegarLoop]: Abstraction has 942 states and 1373 transitions. [2019-11-20 10:18:18,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1373 transitions. [2019-11-20 10:18:18,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-20 10:18:18,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:18,648 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:18,648 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:18,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:18,649 INFO L82 PathProgramCache]: Analyzing trace with hash 239598804, now seen corresponding path program 1 times [2019-11-20 10:18:18,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:18,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778599439] [2019-11-20 10:18:18,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:18,728 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:18,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778599439] [2019-11-20 10:18:18,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:18,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:18,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083349411] [2019-11-20 10:18:18,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:18,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:18,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:18,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:18,730 INFO L87 Difference]: Start difference. First operand 942 states and 1373 transitions. Second operand 4 states. [2019-11-20 10:18:19,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:19,021 INFO L93 Difference]: Finished difference Result 1936 states and 2828 transitions. [2019-11-20 10:18:19,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:19,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-11-20 10:18:19,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:19,022 INFO L225 Difference]: With dead ends: 1936 [2019-11-20 10:18:19,022 INFO L226 Difference]: Without dead ends: 1013 [2019-11-20 10:18:19,023 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:18:19,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-11-20 10:18:19,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 945. [2019-11-20 10:18:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-11-20 10:18:19,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1376 transitions. [2019-11-20 10:18:19,058 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1376 transitions. Word has length 202 [2019-11-20 10:18:19,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:19,058 INFO L462 AbstractCegarLoop]: Abstraction has 945 states and 1376 transitions. [2019-11-20 10:18:19,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:19,058 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1376 transitions. [2019-11-20 10:18:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-20 10:18:19,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:19,061 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:19,061 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:19,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:19,061 INFO L82 PathProgramCache]: Analyzing trace with hash -12834019, now seen corresponding path program 1 times [2019-11-20 10:18:19,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:19,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401704395] [2019-11-20 10:18:19,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:19,137 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:19,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401704395] [2019-11-20 10:18:19,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:19,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:19,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927870033] [2019-11-20 10:18:19,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:19,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:19,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:19,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:19,138 INFO L87 Difference]: Start difference. First operand 945 states and 1376 transitions. Second operand 4 states. [2019-11-20 10:18:19,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:19,439 INFO L93 Difference]: Finished difference Result 1939 states and 2828 transitions. [2019-11-20 10:18:19,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:19,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-11-20 10:18:19,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:19,441 INFO L225 Difference]: With dead ends: 1939 [2019-11-20 10:18:19,441 INFO L226 Difference]: Without dead ends: 1013 [2019-11-20 10:18:19,442 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:18:19,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-11-20 10:18:19,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 948. [2019-11-20 10:18:19,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-11-20 10:18:19,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1379 transitions. [2019-11-20 10:18:19,475 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1379 transitions. Word has length 202 [2019-11-20 10:18:19,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:19,475 INFO L462 AbstractCegarLoop]: Abstraction has 948 states and 1379 transitions. [2019-11-20 10:18:19,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:19,476 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1379 transitions. [2019-11-20 10:18:19,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-20 10:18:19,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:19,477 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:19,477 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:19,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:19,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1620776886, now seen corresponding path program 1 times [2019-11-20 10:18:19,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:19,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953823558] [2019-11-20 10:18:19,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:19,550 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-20 10:18:19,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953823558] [2019-11-20 10:18:19,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:19,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:19,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508076579] [2019-11-20 10:18:19,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:19,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:19,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:19,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:19,552 INFO L87 Difference]: Start difference. First operand 948 states and 1379 transitions. Second operand 4 states. [2019-11-20 10:18:19,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:19,981 INFO L93 Difference]: Finished difference Result 2047 states and 2996 transitions. [2019-11-20 10:18:19,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:19,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2019-11-20 10:18:19,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:19,983 INFO L225 Difference]: With dead ends: 2047 [2019-11-20 10:18:19,983 INFO L226 Difference]: Without dead ends: 1118 [2019-11-20 10:18:19,985 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:18:19,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2019-11-20 10:18:20,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 948. [2019-11-20 10:18:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-11-20 10:18:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1376 transitions. [2019-11-20 10:18:20,037 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1376 transitions. Word has length 203 [2019-11-20 10:18:20,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:20,037 INFO L462 AbstractCegarLoop]: Abstraction has 948 states and 1376 transitions. [2019-11-20 10:18:20,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1376 transitions. [2019-11-20 10:18:20,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-20 10:18:20,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:20,040 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:20,041 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:20,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:20,041 INFO L82 PathProgramCache]: Analyzing trace with hash 2030196123, now seen corresponding path program 1 times [2019-11-20 10:18:20,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:20,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034004412] [2019-11-20 10:18:20,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:20,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034004412] [2019-11-20 10:18:20,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:20,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:20,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142541002] [2019-11-20 10:18:20,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:20,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:20,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:20,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:20,167 INFO L87 Difference]: Start difference. First operand 948 states and 1376 transitions. Second operand 4 states. [2019-11-20 10:18:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:20,512 INFO L93 Difference]: Finished difference Result 1936 states and 2816 transitions. [2019-11-20 10:18:20,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:20,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2019-11-20 10:18:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:20,514 INFO L225 Difference]: With dead ends: 1936 [2019-11-20 10:18:20,515 INFO L226 Difference]: Without dead ends: 1007 [2019-11-20 10:18:20,516 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:18:20,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-11-20 10:18:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 951. [2019-11-20 10:18:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-11-20 10:18:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1379 transitions. [2019-11-20 10:18:20,560 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1379 transitions. Word has length 203 [2019-11-20 10:18:20,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:20,560 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 1379 transitions. [2019-11-20 10:18:20,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:20,561 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1379 transitions. [2019-11-20 10:18:20,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-20 10:18:20,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:20,563 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:20,563 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:20,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:20,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2069327042, now seen corresponding path program 1 times [2019-11-20 10:18:20,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:20,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897268910] [2019-11-20 10:18:20,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:20,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897268910] [2019-11-20 10:18:20,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:20,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:20,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248853490] [2019-11-20 10:18:20,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:20,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:20,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:20,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:20,658 INFO L87 Difference]: Start difference. First operand 951 states and 1379 transitions. Second operand 4 states. [2019-11-20 10:18:20,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:20,997 INFO L93 Difference]: Finished difference Result 1939 states and 2816 transitions. [2019-11-20 10:18:20,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:20,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-11-20 10:18:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:20,998 INFO L225 Difference]: With dead ends: 1939 [2019-11-20 10:18:20,998 INFO L226 Difference]: Without dead ends: 1007 [2019-11-20 10:18:20,999 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:18:21,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-11-20 10:18:21,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 954. [2019-11-20 10:18:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 954 states. [2019-11-20 10:18:21,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1382 transitions. [2019-11-20 10:18:21,027 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1382 transitions. Word has length 204 [2019-11-20 10:18:21,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:21,027 INFO L462 AbstractCegarLoop]: Abstraction has 954 states and 1382 transitions. [2019-11-20 10:18:21,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1382 transitions. [2019-11-20 10:18:21,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-20 10:18:21,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:21,028 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:21,029 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:21,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:21,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1092096096, now seen corresponding path program 1 times [2019-11-20 10:18:21,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:21,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374407797] [2019-11-20 10:18:21,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:21,113 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:21,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374407797] [2019-11-20 10:18:21,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:21,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:21,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678624097] [2019-11-20 10:18:21,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:21,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:21,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:21,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:21,115 INFO L87 Difference]: Start difference. First operand 954 states and 1382 transitions. Second operand 4 states. [2019-11-20 10:18:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:21,414 INFO L93 Difference]: Finished difference Result 1936 states and 2810 transitions. [2019-11-20 10:18:21,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:21,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2019-11-20 10:18:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:21,415 INFO L225 Difference]: With dead ends: 1936 [2019-11-20 10:18:21,415 INFO L226 Difference]: Without dead ends: 1001 [2019-11-20 10:18:21,416 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:18:21,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2019-11-20 10:18:21,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 957. [2019-11-20 10:18:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-11-20 10:18:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1385 transitions. [2019-11-20 10:18:21,440 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1385 transitions. Word has length 205 [2019-11-20 10:18:21,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:21,440 INFO L462 AbstractCegarLoop]: Abstraction has 957 states and 1385 transitions. [2019-11-20 10:18:21,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1385 transitions. [2019-11-20 10:18:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-20 10:18:21,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:21,442 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:21,442 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:21,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:21,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1367370904, now seen corresponding path program 2 times [2019-11-20 10:18:21,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:21,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594957531] [2019-11-20 10:18:21,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-20 10:18:21,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594957531] [2019-11-20 10:18:21,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:21,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:21,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172814436] [2019-11-20 10:18:21,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:21,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:21,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:21,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:21,522 INFO L87 Difference]: Start difference. First operand 957 states and 1385 transitions. Second operand 4 states. [2019-11-20 10:18:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:21,891 INFO L93 Difference]: Finished difference Result 2065 states and 3008 transitions. [2019-11-20 10:18:21,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:21,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2019-11-20 10:18:21,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:21,892 INFO L225 Difference]: With dead ends: 2065 [2019-11-20 10:18:21,892 INFO L226 Difference]: Without dead ends: 1127 [2019-11-20 10:18:21,893 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:18:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2019-11-20 10:18:21,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 960. [2019-11-20 10:18:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-11-20 10:18:21,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1388 transitions. [2019-11-20 10:18:21,919 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1388 transitions. Word has length 206 [2019-11-20 10:18:21,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:21,920 INFO L462 AbstractCegarLoop]: Abstraction has 960 states and 1388 transitions. [2019-11-20 10:18:21,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:21,920 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1388 transitions. [2019-11-20 10:18:21,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-20 10:18:21,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:21,921 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:21,922 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:21,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:21,922 INFO L82 PathProgramCache]: Analyzing trace with hash 821017813, now seen corresponding path program 1 times [2019-11-20 10:18:21,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:21,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343552583] [2019-11-20 10:18:21,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-20 10:18:21,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343552583] [2019-11-20 10:18:21,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:21,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:21,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311106770] [2019-11-20 10:18:21,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:21,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:21,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:21,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:21,987 INFO L87 Difference]: Start difference. First operand 960 states and 1388 transitions. Second operand 4 states. [2019-11-20 10:18:22,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:22,334 INFO L93 Difference]: Finished difference Result 2056 states and 2993 transitions. [2019-11-20 10:18:22,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:22,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2019-11-20 10:18:22,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:22,336 INFO L225 Difference]: With dead ends: 2056 [2019-11-20 10:18:22,336 INFO L226 Difference]: Without dead ends: 1115 [2019-11-20 10:18:22,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:18:22,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2019-11-20 10:18:22,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 963. [2019-11-20 10:18:22,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-11-20 10:18:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1391 transitions. [2019-11-20 10:18:22,364 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1391 transitions. Word has length 207 [2019-11-20 10:18:22,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:22,364 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1391 transitions. [2019-11-20 10:18:22,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1391 transitions. [2019-11-20 10:18:22,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-20 10:18:22,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:22,366 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:22,366 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:22,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:22,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1524612265, now seen corresponding path program 1 times [2019-11-20 10:18:22,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:22,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948352480] [2019-11-20 10:18:22,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:22,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948352480] [2019-11-20 10:18:22,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:22,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:22,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056825839] [2019-11-20 10:18:22,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:22,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:22,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:22,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:22,489 INFO L87 Difference]: Start difference. First operand 963 states and 1391 transitions. Second operand 4 states. [2019-11-20 10:18:22,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:22,754 INFO L93 Difference]: Finished difference Result 1951 states and 2822 transitions. [2019-11-20 10:18:22,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:22,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-11-20 10:18:22,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:22,755 INFO L225 Difference]: With dead ends: 1951 [2019-11-20 10:18:22,755 INFO L226 Difference]: Without dead ends: 1007 [2019-11-20 10:18:22,756 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:18:22,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-11-20 10:18:22,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 966. [2019-11-20 10:18:22,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2019-11-20 10:18:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1394 transitions. [2019-11-20 10:18:22,783 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1394 transitions. Word has length 208 [2019-11-20 10:18:22,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:22,784 INFO L462 AbstractCegarLoop]: Abstraction has 966 states and 1394 transitions. [2019-11-20 10:18:22,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1394 transitions. [2019-11-20 10:18:22,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-20 10:18:22,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:22,786 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:22,786 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:22,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:22,786 INFO L82 PathProgramCache]: Analyzing trace with hash 484366823, now seen corresponding path program 1 times [2019-11-20 10:18:22,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:22,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226666077] [2019-11-20 10:18:22,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:22,869 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:22,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226666077] [2019-11-20 10:18:22,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:22,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:22,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911172343] [2019-11-20 10:18:22,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:22,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:22,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:22,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:22,871 INFO L87 Difference]: Start difference. First operand 966 states and 1394 transitions. Second operand 4 states. [2019-11-20 10:18:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:23,132 INFO L93 Difference]: Finished difference Result 1945 states and 2810 transitions. [2019-11-20 10:18:23,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:23,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 209 [2019-11-20 10:18:23,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:23,133 INFO L225 Difference]: With dead ends: 1945 [2019-11-20 10:18:23,133 INFO L226 Difference]: Without dead ends: 998 [2019-11-20 10:18:23,134 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:18:23,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-11-20 10:18:23,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 969. [2019-11-20 10:18:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-11-20 10:18:23,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1397 transitions. [2019-11-20 10:18:23,160 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1397 transitions. Word has length 209 [2019-11-20 10:18:23,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:23,160 INFO L462 AbstractCegarLoop]: Abstraction has 969 states and 1397 transitions. [2019-11-20 10:18:23,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1397 transitions. [2019-11-20 10:18:23,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-20 10:18:23,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:23,162 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:23,162 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:23,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:23,162 INFO L82 PathProgramCache]: Analyzing trace with hash 427109949, now seen corresponding path program 1 times [2019-11-20 10:18:23,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:23,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662230032] [2019-11-20 10:18:23,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-20 10:18:23,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662230032] [2019-11-20 10:18:23,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:23,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:23,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525632488] [2019-11-20 10:18:23,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:23,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:23,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:23,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:23,237 INFO L87 Difference]: Start difference. First operand 969 states and 1397 transitions. Second operand 4 states. [2019-11-20 10:18:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:23,706 INFO L93 Difference]: Finished difference Result 2071 states and 3005 transitions. [2019-11-20 10:18:23,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:23,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-11-20 10:18:23,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:23,708 INFO L225 Difference]: With dead ends: 2071 [2019-11-20 10:18:23,708 INFO L226 Difference]: Without dead ends: 1121 [2019-11-20 10:18:23,709 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:18:23,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2019-11-20 10:18:23,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 978. [2019-11-20 10:18:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2019-11-20 10:18:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1412 transitions. [2019-11-20 10:18:23,736 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1412 transitions. Word has length 210 [2019-11-20 10:18:23,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:23,736 INFO L462 AbstractCegarLoop]: Abstraction has 978 states and 1412 transitions. [2019-11-20 10:18:23,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:23,736 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1412 transitions. [2019-11-20 10:18:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-20 10:18:23,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:23,738 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:23,738 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:23,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:23,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1706334230, now seen corresponding path program 1 times [2019-11-20 10:18:23,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:23,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259221915] [2019-11-20 10:18:23,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-20 10:18:23,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259221915] [2019-11-20 10:18:23,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:23,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:23,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056594534] [2019-11-20 10:18:23,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:23,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:23,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:23,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:23,820 INFO L87 Difference]: Start difference. First operand 978 states and 1412 transitions. Second operand 4 states. [2019-11-20 10:18:24,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:24,174 INFO L93 Difference]: Finished difference Result 2056 states and 2978 transitions. [2019-11-20 10:18:24,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:24,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-11-20 10:18:24,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:24,176 INFO L225 Difference]: With dead ends: 2056 [2019-11-20 10:18:24,176 INFO L226 Difference]: Without dead ends: 1097 [2019-11-20 10:18:24,177 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:18:24,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2019-11-20 10:18:24,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 981. [2019-11-20 10:18:24,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-11-20 10:18:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1415 transitions. [2019-11-20 10:18:24,217 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1415 transitions. Word has length 211 [2019-11-20 10:18:24,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:24,217 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 1415 transitions. [2019-11-20 10:18:24,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:24,217 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1415 transitions. [2019-11-20 10:18:24,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-20 10:18:24,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:24,219 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:24,220 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:24,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:24,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1181523542, now seen corresponding path program 1 times [2019-11-20 10:18:24,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:24,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70443023] [2019-11-20 10:18:24,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:24,286 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-20 10:18:24,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70443023] [2019-11-20 10:18:24,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:24,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:24,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773790275] [2019-11-20 10:18:24,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:24,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:24,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:24,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:24,287 INFO L87 Difference]: Start difference. First operand 981 states and 1415 transitions. Second operand 4 states. [2019-11-20 10:18:24,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:24,655 INFO L93 Difference]: Finished difference Result 2059 states and 2978 transitions. [2019-11-20 10:18:24,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:24,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-11-20 10:18:24,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:24,657 INFO L225 Difference]: With dead ends: 2059 [2019-11-20 10:18:24,657 INFO L226 Difference]: Without dead ends: 1097 [2019-11-20 10:18:24,658 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:18:24,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2019-11-20 10:18:24,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 984. [2019-11-20 10:18:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-11-20 10:18:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1418 transitions. [2019-11-20 10:18:24,697 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1418 transitions. Word has length 211 [2019-11-20 10:18:24,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:24,697 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1418 transitions. [2019-11-20 10:18:24,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1418 transitions. [2019-11-20 10:18:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-20 10:18:24,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:24,698 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:24,699 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:24,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:24,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1847479437, now seen corresponding path program 1 times [2019-11-20 10:18:24,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:24,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076856002] [2019-11-20 10:18:24,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-20 10:18:24,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076856002] [2019-11-20 10:18:24,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:24,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:24,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318533218] [2019-11-20 10:18:24,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:24,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:24,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:24,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:24,775 INFO L87 Difference]: Start difference. First operand 984 states and 1418 transitions. Second operand 4 states. [2019-11-20 10:18:25,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:25,113 INFO L93 Difference]: Finished difference Result 2062 states and 2978 transitions. [2019-11-20 10:18:25,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:25,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-11-20 10:18:25,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:25,114 INFO L225 Difference]: With dead ends: 2062 [2019-11-20 10:18:25,115 INFO L226 Difference]: Without dead ends: 1097 [2019-11-20 10:18:25,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:18:25,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2019-11-20 10:18:25,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 984. [2019-11-20 10:18:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-11-20 10:18:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1415 transitions. [2019-11-20 10:18:25,154 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1415 transitions. Word has length 212 [2019-11-20 10:18:25,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:25,154 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1415 transitions. [2019-11-20 10:18:25,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1415 transitions. [2019-11-20 10:18:25,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-20 10:18:25,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:25,157 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:25,157 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:25,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:25,158 INFO L82 PathProgramCache]: Analyzing trace with hash -2059879703, now seen corresponding path program 1 times [2019-11-20 10:18:25,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:25,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013103482] [2019-11-20 10:18:25,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 329 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-20 10:18:25,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013103482] [2019-11-20 10:18:25,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:25,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:25,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631722417] [2019-11-20 10:18:25,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:25,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:25,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:25,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:25,255 INFO L87 Difference]: Start difference. First operand 984 states and 1415 transitions. Second operand 4 states. [2019-11-20 10:18:25,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:25,585 INFO L93 Difference]: Finished difference Result 2056 states and 2966 transitions. [2019-11-20 10:18:25,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:25,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-11-20 10:18:25,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:25,587 INFO L225 Difference]: With dead ends: 2056 [2019-11-20 10:18:25,587 INFO L226 Difference]: Without dead ends: 1091 [2019-11-20 10:18:25,588 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:18:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2019-11-20 10:18:25,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 987. [2019-11-20 10:18:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987 states. [2019-11-20 10:18:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1418 transitions. [2019-11-20 10:18:25,617 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1418 transitions. Word has length 212 [2019-11-20 10:18:25,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:25,617 INFO L462 AbstractCegarLoop]: Abstraction has 987 states and 1418 transitions. [2019-11-20 10:18:25,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:25,618 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1418 transitions. [2019-11-20 10:18:25,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-20 10:18:25,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:25,619 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:25,619 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:25,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:25,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1107912064, now seen corresponding path program 1 times [2019-11-20 10:18:25,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:25,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521369747] [2019-11-20 10:18:25,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-20 10:18:25,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521369747] [2019-11-20 10:18:25,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:25,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:25,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811915799] [2019-11-20 10:18:25,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:25,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:25,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:25,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:25,702 INFO L87 Difference]: Start difference. First operand 987 states and 1418 transitions. Second operand 4 states. [2019-11-20 10:18:26,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:26,129 INFO L93 Difference]: Finished difference Result 2053 states and 2957 transitions. [2019-11-20 10:18:26,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:26,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2019-11-20 10:18:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:26,130 INFO L225 Difference]: With dead ends: 2053 [2019-11-20 10:18:26,130 INFO L226 Difference]: Without dead ends: 1085 [2019-11-20 10:18:26,131 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:18:26,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2019-11-20 10:18:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 987. [2019-11-20 10:18:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987 states. [2019-11-20 10:18:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1415 transitions. [2019-11-20 10:18:26,160 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1415 transitions. Word has length 213 [2019-11-20 10:18:26,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:26,161 INFO L462 AbstractCegarLoop]: Abstraction has 987 states and 1415 transitions. [2019-11-20 10:18:26,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1415 transitions. [2019-11-20 10:18:26,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-20 10:18:26,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:26,162 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:26,162 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:26,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:26,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1873041400, now seen corresponding path program 1 times [2019-11-20 10:18:26,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:26,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951196597] [2019-11-20 10:18:26,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:26,222 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-20 10:18:26,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951196597] [2019-11-20 10:18:26,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:26,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:26,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162589603] [2019-11-20 10:18:26,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:26,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:26,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:26,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:26,223 INFO L87 Difference]: Start difference. First operand 987 states and 1415 transitions. Second operand 4 states. [2019-11-20 10:18:26,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:26,519 INFO L93 Difference]: Finished difference Result 2044 states and 2939 transitions. [2019-11-20 10:18:26,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:26,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2019-11-20 10:18:26,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:26,521 INFO L225 Difference]: With dead ends: 2044 [2019-11-20 10:18:26,521 INFO L226 Difference]: Without dead ends: 1076 [2019-11-20 10:18:26,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:18:26,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-11-20 10:18:26,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 990. [2019-11-20 10:18:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990 states. [2019-11-20 10:18:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1418 transitions. [2019-11-20 10:18:26,556 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1418 transitions. Word has length 213 [2019-11-20 10:18:26,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:26,556 INFO L462 AbstractCegarLoop]: Abstraction has 990 states and 1418 transitions. [2019-11-20 10:18:26,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1418 transitions. [2019-11-20 10:18:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-20 10:18:26,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:26,558 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:26,558 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:26,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:26,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1540388444, now seen corresponding path program 1 times [2019-11-20 10:18:26,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:26,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020273840] [2019-11-20 10:18:26,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 138 proven. 18 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2019-11-20 10:18:26,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020273840] [2019-11-20 10:18:26,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646322752] [2019-11-20 10:18:26,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:18:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:27,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 10:18:27,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:18:27,138 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-20 10:18:27,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:27,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:27,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:27,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-20 10:18:27,183 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-20 10:18:27,184 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-20 10:18:27,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:27,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:27,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:27,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-20 10:18:27,238 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 10:18:27,238 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-20 10:18:27,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:27,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:27,241 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:18:27,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-20 10:18:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 138 proven. 18 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2019-11-20 10:18:27,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:18:27,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-20 10:18:27,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580181004] [2019-11-20 10:18:27,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 10:18:27,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:27,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 10:18:27,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:18:27,346 INFO L87 Difference]: Start difference. First operand 990 states and 1418 transitions. Second operand 9 states. [2019-11-20 10:18:28,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:28,826 INFO L93 Difference]: Finished difference Result 2464 states and 3588 transitions. [2019-11-20 10:18:28,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 10:18:28,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 213 [2019-11-20 10:18:28,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:28,838 INFO L225 Difference]: With dead ends: 2464 [2019-11-20 10:18:28,838 INFO L226 Difference]: Without dead ends: 1493 [2019-11-20 10:18:28,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-20 10:18:28,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2019-11-20 10:18:28,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1164. [2019-11-20 10:18:28,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2019-11-20 10:18:28,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1736 transitions. [2019-11-20 10:18:28,941 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1736 transitions. Word has length 213 [2019-11-20 10:18:28,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:28,941 INFO L462 AbstractCegarLoop]: Abstraction has 1164 states and 1736 transitions. [2019-11-20 10:18:28,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 10:18:28,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1736 transitions. [2019-11-20 10:18:28,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 10:18:28,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:28,945 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:29,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:18:29,155 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:29,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:29,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1734651336, now seen corresponding path program 1 times [2019-11-20 10:18:29,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:29,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628678232] [2019-11-20 10:18:29,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-11-20 10:18:29,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628678232] [2019-11-20 10:18:29,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:29,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:29,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525718351] [2019-11-20 10:18:29,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:29,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:29,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:29,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:29,283 INFO L87 Difference]: Start difference. First operand 1164 states and 1736 transitions. Second operand 4 states. [2019-11-20 10:18:29,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:29,810 INFO L93 Difference]: Finished difference Result 2444 states and 3644 transitions. [2019-11-20 10:18:29,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:29,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2019-11-20 10:18:29,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:29,813 INFO L225 Difference]: With dead ends: 2444 [2019-11-20 10:18:29,813 INFO L226 Difference]: Without dead ends: 1299 [2019-11-20 10:18:29,814 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:18:29,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2019-11-20 10:18:29,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1188. [2019-11-20 10:18:29,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2019-11-20 10:18:29,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1778 transitions. [2019-11-20 10:18:29,868 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1778 transitions. Word has length 217 [2019-11-20 10:18:29,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:29,868 INFO L462 AbstractCegarLoop]: Abstraction has 1188 states and 1778 transitions. [2019-11-20 10:18:29,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:29,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1778 transitions. [2019-11-20 10:18:29,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-20 10:18:29,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:29,871 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:29,872 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:29,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:29,872 INFO L82 PathProgramCache]: Analyzing trace with hash -416366930, now seen corresponding path program 1 times [2019-11-20 10:18:29,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:29,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999386014] [2019-11-20 10:18:29,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 244 proven. 68 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-20 10:18:30,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999386014] [2019-11-20 10:18:30,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296097926] [2019-11-20 10:18:30,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:18:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:30,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 10:18:30,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:18:30,336 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 25 treesize of output 21 [2019-11-20 10:18:30,340 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 24 treesize of output 16 [2019-11-20 10:18:30,340 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-20 10:18:30,346 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-20 10:18:30,347 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:30,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:30,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:30,348 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-20 10:18:30,360 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:18:30,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:30,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:30,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:30,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-20 10:18:30,375 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-11-20 10:18:30,391 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-20 10:18:30,392 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-20 10:18:30,392 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:30,405 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-20 10:18:30,405 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:30,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:30,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:30,411 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-20 10:18:30,440 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 10:18:30,441 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-20 10:18:30,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:30,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:30,444 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:18:30,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-20 10:18:30,499 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 241 proven. 13 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-11-20 10:18:30,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:18:30,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-20 10:18:30,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647491984] [2019-11-20 10:18:30,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 10:18:30,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:30,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 10:18:30,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:18:30,501 INFO L87 Difference]: Start difference. First operand 1188 states and 1778 transitions. Second operand 9 states. [2019-11-20 10:18:31,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:31,404 INFO L93 Difference]: Finished difference Result 2627 states and 3904 transitions. [2019-11-20 10:18:31,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 10:18:31,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 219 [2019-11-20 10:18:31,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:31,411 INFO L225 Difference]: With dead ends: 2627 [2019-11-20 10:18:31,411 INFO L226 Difference]: Without dead ends: 1458 [2019-11-20 10:18:31,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 216 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-20 10:18:31,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2019-11-20 10:18:31,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1188. [2019-11-20 10:18:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2019-11-20 10:18:31,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1772 transitions. [2019-11-20 10:18:31,468 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1772 transitions. Word has length 219 [2019-11-20 10:18:31,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:31,468 INFO L462 AbstractCegarLoop]: Abstraction has 1188 states and 1772 transitions. [2019-11-20 10:18:31,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 10:18:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1772 transitions. [2019-11-20 10:18:31,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-20 10:18:31,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:31,471 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:31,675 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:18:31,675 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:31,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:31,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1907908715, now seen corresponding path program 1 times [2019-11-20 10:18:31,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:31,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62952473] [2019-11-20 10:18:31,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 246 proven. 70 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-20 10:18:31,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62952473] [2019-11-20 10:18:31,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229854862] [2019-11-20 10:18:31,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:18:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:32,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 10:18:32,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:18:32,112 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 25 treesize of output 21 [2019-11-20 10:18:32,125 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 24 treesize of output 16 [2019-11-20 10:18:32,126 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-20 10:18:32,132 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-20 10:18:32,133 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:32,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:32,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:32,136 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-20 10:18:32,155 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:18:32,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:32,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:32,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:32,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-20 10:18:32,169 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-11-20 10:18:32,183 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-20 10:18:32,184 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-20 10:18:32,184 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:32,197 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-20 10:18:32,197 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:32,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:32,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:32,204 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-20 10:18:32,234 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 10:18:32,234 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-20 10:18:32,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:32,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:32,238 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:18:32,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-20 10:18:32,296 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 244 proven. 12 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-11-20 10:18:32,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:18:32,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-20 10:18:32,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996412821] [2019-11-20 10:18:32,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 10:18:32,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:32,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 10:18:32,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:18:32,298 INFO L87 Difference]: Start difference. First operand 1188 states and 1772 transitions. Second operand 9 states. [2019-11-20 10:18:33,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:33,507 INFO L93 Difference]: Finished difference Result 2621 states and 3886 transitions. [2019-11-20 10:18:33,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 10:18:33,508 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 220 [2019-11-20 10:18:33,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:33,510 INFO L225 Difference]: With dead ends: 2621 [2019-11-20 10:18:33,510 INFO L226 Difference]: Without dead ends: 1452 [2019-11-20 10:18:33,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 217 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-20 10:18:33,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2019-11-20 10:18:33,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1188. [2019-11-20 10:18:33,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2019-11-20 10:18:33,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1766 transitions. [2019-11-20 10:18:33,582 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1766 transitions. Word has length 220 [2019-11-20 10:18:33,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:33,583 INFO L462 AbstractCegarLoop]: Abstraction has 1188 states and 1766 transitions. [2019-11-20 10:18:33,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 10:18:33,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1766 transitions. [2019-11-20 10:18:33,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-20 10:18:33,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:33,587 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:33,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:18:33,791 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:33,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:33,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1335119462, now seen corresponding path program 1 times [2019-11-20 10:18:33,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:33,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799847716] [2019-11-20 10:18:33,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:33,949 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 248 proven. 72 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-20 10:18:33,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799847716] [2019-11-20 10:18:33,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129156372] [2019-11-20 10:18:33,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:18:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:34,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 10:18:34,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:18:34,232 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 25 treesize of output 21 [2019-11-20 10:18:34,237 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 24 treesize of output 16 [2019-11-20 10:18:34,237 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-20 10:18:34,244 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-20 10:18:34,244 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:34,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:34,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:34,247 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-20 10:18:34,266 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:18:34,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:34,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:34,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:34,271 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-20 10:18:34,283 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-11-20 10:18:34,306 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-20 10:18:34,306 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-20 10:18:34,307 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:34,319 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-20 10:18:34,320 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:34,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:34,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:34,326 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-20 10:18:34,352 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 10:18:34,353 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-20 10:18:34,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:34,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:34,355 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:18:34,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-20 10:18:34,412 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 247 proven. 11 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-20 10:18:34,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:18:34,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-20 10:18:34,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473938715] [2019-11-20 10:18:34,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 10:18:34,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:34,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 10:18:34,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:18:34,414 INFO L87 Difference]: Start difference. First operand 1188 states and 1766 transitions. Second operand 9 states. [2019-11-20 10:18:35,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:35,582 INFO L93 Difference]: Finished difference Result 2708 states and 4027 transitions. [2019-11-20 10:18:35,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 10:18:35,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 220 [2019-11-20 10:18:35,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:35,586 INFO L225 Difference]: With dead ends: 2708 [2019-11-20 10:18:35,587 INFO L226 Difference]: Without dead ends: 1539 [2019-11-20 10:18:35,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 217 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-20 10:18:35,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2019-11-20 10:18:35,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1275. [2019-11-20 10:18:35,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-11-20 10:18:35,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1916 transitions. [2019-11-20 10:18:35,635 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1916 transitions. Word has length 220 [2019-11-20 10:18:35,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:35,636 INFO L462 AbstractCegarLoop]: Abstraction has 1275 states and 1916 transitions. [2019-11-20 10:18:35,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 10:18:35,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1916 transitions. [2019-11-20 10:18:35,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-20 10:18:35,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:35,639 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:35,843 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:18:35,844 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:35,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:35,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1658860456, now seen corresponding path program 1 times [2019-11-20 10:18:35,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:35,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122872269] [2019-11-20 10:18:35,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 238 proven. 62 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-20 10:18:35,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122872269] [2019-11-20 10:18:35,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727593470] [2019-11-20 10:18:35,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:18:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:36,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 10:18:36,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:18:36,237 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 25 treesize of output 21 [2019-11-20 10:18:36,240 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 24 treesize of output 16 [2019-11-20 10:18:36,241 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-20 10:18:36,247 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-20 10:18:36,247 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:36,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:36,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:36,250 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-20 10:18:36,264 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:18:36,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:36,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:36,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:36,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-20 10:18:36,271 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-11-20 10:18:36,281 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-20 10:18:36,282 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-20 10:18:36,282 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:36,290 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-20 10:18:36,291 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:36,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:36,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:36,295 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-20 10:18:36,313 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 10:18:36,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-20 10:18:36,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:36,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:36,318 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:18:36,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-20 10:18:36,360 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 232 proven. 16 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 10:18:36,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:18:36,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-20 10:18:36,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089372690] [2019-11-20 10:18:36,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 10:18:36,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:36,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 10:18:36,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:18:36,361 INFO L87 Difference]: Start difference. First operand 1275 states and 1916 transitions. Second operand 9 states. [2019-11-20 10:18:37,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:37,195 INFO L93 Difference]: Finished difference Result 2747 states and 4105 transitions. [2019-11-20 10:18:37,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 10:18:37,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 221 [2019-11-20 10:18:37,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:37,197 INFO L225 Difference]: With dead ends: 2747 [2019-11-20 10:18:37,197 INFO L226 Difference]: Without dead ends: 1491 [2019-11-20 10:18:37,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 218 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-20 10:18:37,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2019-11-20 10:18:37,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1275. [2019-11-20 10:18:37,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-11-20 10:18:37,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1904 transitions. [2019-11-20 10:18:37,258 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1904 transitions. Word has length 221 [2019-11-20 10:18:37,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:37,258 INFO L462 AbstractCegarLoop]: Abstraction has 1275 states and 1904 transitions. [2019-11-20 10:18:37,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 10:18:37,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1904 transitions. [2019-11-20 10:18:37,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-11-20 10:18:37,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:37,261 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:37,464 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:18:37,465 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:37,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:37,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1531874337, now seen corresponding path program 1 times [2019-11-20 10:18:37,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:37,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905710503] [2019-11-20 10:18:37,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 240 proven. 64 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-20 10:18:37,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905710503] [2019-11-20 10:18:37,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247051727] [2019-11-20 10:18:37,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:18:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:37,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 10:18:37,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:18:37,863 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 25 treesize of output 21 [2019-11-20 10:18:37,868 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 24 treesize of output 16 [2019-11-20 10:18:37,869 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-20 10:18:37,874 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-20 10:18:37,875 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:37,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:37,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:37,877 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-20 10:18:37,890 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:18:37,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:37,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:37,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:37,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-20 10:18:37,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-11-20 10:18:37,911 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-20 10:18:37,912 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-20 10:18:37,912 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:37,920 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-20 10:18:37,920 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:37,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:37,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:37,925 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-20 10:18:37,944 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 10:18:37,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-20 10:18:37,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:37,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:37,947 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:18:37,947 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-20 10:18:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 235 proven. 15 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-20 10:18:37,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:18:37,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-20 10:18:37,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965978971] [2019-11-20 10:18:37,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 10:18:37,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:37,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 10:18:37,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:18:37,992 INFO L87 Difference]: Start difference. First operand 1275 states and 1904 transitions. Second operand 9 states. [2019-11-20 10:18:38,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:38,879 INFO L93 Difference]: Finished difference Result 2858 states and 4267 transitions. [2019-11-20 10:18:38,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 10:18:38,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 222 [2019-11-20 10:18:38,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:38,881 INFO L225 Difference]: With dead ends: 2858 [2019-11-20 10:18:38,881 INFO L226 Difference]: Without dead ends: 1602 [2019-11-20 10:18:38,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 219 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-20 10:18:38,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2019-11-20 10:18:38,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1359. [2019-11-20 10:18:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1359 states. [2019-11-20 10:18:38,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2036 transitions. [2019-11-20 10:18:38,924 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2036 transitions. Word has length 222 [2019-11-20 10:18:38,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:38,925 INFO L462 AbstractCegarLoop]: Abstraction has 1359 states and 2036 transitions. [2019-11-20 10:18:38,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 10:18:38,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2036 transitions. [2019-11-20 10:18:38,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-20 10:18:38,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:38,928 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:39,131 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:18:39,132 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:39,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:39,132 INFO L82 PathProgramCache]: Analyzing trace with hash -2066906502, now seen corresponding path program 1 times [2019-11-20 10:18:39,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:39,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47379220] [2019-11-20 10:18:39,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 242 proven. 66 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 10:18:39,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47379220] [2019-11-20 10:18:39,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776504099] [2019-11-20 10:18:39,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:18:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:39,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 10:18:39,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:18:39,603 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 25 treesize of output 21 [2019-11-20 10:18:39,607 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 24 treesize of output 16 [2019-11-20 10:18:39,607 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-20 10:18:39,614 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-20 10:18:39,614 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:39,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:39,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:39,618 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-20 10:18:39,634 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:18:39,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:39,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:39,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:39,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-20 10:18:39,646 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-11-20 10:18:39,665 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-20 10:18:39,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-20 10:18:39,666 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:39,678 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-20 10:18:39,678 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:39,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:39,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:39,684 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-20 10:18:39,710 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 10:18:39,711 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-20 10:18:39,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:39,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:39,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:39,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-20 10:18:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 238 proven. 14 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-11-20 10:18:39,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:18:39,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-20 10:18:39,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396325770] [2019-11-20 10:18:39,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 10:18:39,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:39,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 10:18:39,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:18:39,782 INFO L87 Difference]: Start difference. First operand 1359 states and 2036 transitions. Second operand 9 states. [2019-11-20 10:18:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:40,674 INFO L93 Difference]: Finished difference Result 2918 states and 4348 transitions. [2019-11-20 10:18:40,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 10:18:40,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 223 [2019-11-20 10:18:40,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:40,676 INFO L225 Difference]: With dead ends: 2918 [2019-11-20 10:18:40,676 INFO L226 Difference]: Without dead ends: 1578 [2019-11-20 10:18:40,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 220 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-20 10:18:40,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2019-11-20 10:18:40,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1347. [2019-11-20 10:18:40,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-11-20 10:18:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 2012 transitions. [2019-11-20 10:18:40,716 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 2012 transitions. Word has length 223 [2019-11-20 10:18:40,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:40,717 INFO L462 AbstractCegarLoop]: Abstraction has 1347 states and 2012 transitions. [2019-11-20 10:18:40,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 10:18:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 2012 transitions. [2019-11-20 10:18:40,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-20 10:18:40,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:40,719 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:40,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:18:40,920 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:40,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:40,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1448290572, now seen corresponding path program 1 times [2019-11-20 10:18:40,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:40,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085851705] [2019-11-20 10:18:40,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-11-20 10:18:40,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085851705] [2019-11-20 10:18:40,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:40,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:40,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306882668] [2019-11-20 10:18:40,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:40,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:40,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:40,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:40,998 INFO L87 Difference]: Start difference. First operand 1347 states and 2012 transitions. Second operand 4 states. [2019-11-20 10:18:41,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:41,264 INFO L93 Difference]: Finished difference Result 2786 states and 4167 transitions. [2019-11-20 10:18:41,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:41,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2019-11-20 10:18:41,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:41,267 INFO L225 Difference]: With dead ends: 2786 [2019-11-20 10:18:41,267 INFO L226 Difference]: Without dead ends: 1458 [2019-11-20 10:18:41,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:18:41,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2019-11-20 10:18:41,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1410. [2019-11-20 10:18:41,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1410 states. [2019-11-20 10:18:41,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2117 transitions. [2019-11-20 10:18:41,318 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2117 transitions. Word has length 223 [2019-11-20 10:18:41,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:41,318 INFO L462 AbstractCegarLoop]: Abstraction has 1410 states and 2117 transitions. [2019-11-20 10:18:41,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:41,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2117 transitions. [2019-11-20 10:18:41,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-20 10:18:41,319 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:41,320 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:41,320 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:41,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:41,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1609780127, now seen corresponding path program 1 times [2019-11-20 10:18:41,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:41,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003552148] [2019-11-20 10:18:41,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:41,436 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-11-20 10:18:41,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003552148] [2019-11-20 10:18:41,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:41,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:41,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243131740] [2019-11-20 10:18:41,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:41,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:41,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:41,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:41,437 INFO L87 Difference]: Start difference. First operand 1410 states and 2117 transitions. Second operand 4 states. [2019-11-20 10:18:41,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:41,755 INFO L93 Difference]: Finished difference Result 2999 states and 4499 transitions. [2019-11-20 10:18:41,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:41,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2019-11-20 10:18:41,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:41,757 INFO L225 Difference]: With dead ends: 2999 [2019-11-20 10:18:41,757 INFO L226 Difference]: Without dead ends: 1608 [2019-11-20 10:18:41,758 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:18:41,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2019-11-20 10:18:41,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1515. [2019-11-20 10:18:41,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2019-11-20 10:18:41,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2285 transitions. [2019-11-20 10:18:41,800 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2285 transitions. Word has length 224 [2019-11-20 10:18:41,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:41,800 INFO L462 AbstractCegarLoop]: Abstraction has 1515 states and 2285 transitions. [2019-11-20 10:18:41,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:41,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2285 transitions. [2019-11-20 10:18:41,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-20 10:18:41,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:41,801 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:41,801 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:41,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:41,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1270050593, now seen corresponding path program 1 times [2019-11-20 10:18:41,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:41,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851075357] [2019-11-20 10:18:41,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:41,941 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 254 proven. 78 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-20 10:18:41,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851075357] [2019-11-20 10:18:41,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018847038] [2019-11-20 10:18:41,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:18:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:42,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 10:18:42,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:18:42,164 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 25 treesize of output 21 [2019-11-20 10:18:42,168 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 24 treesize of output 16 [2019-11-20 10:18:42,169 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-20 10:18:42,174 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-20 10:18:42,174 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:42,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:42,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:42,176 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-20 10:18:42,189 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:18:42,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:42,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:42,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:42,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-20 10:18:42,208 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-11-20 10:18:42,221 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-20 10:18:42,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-20 10:18:42,222 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:42,235 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-20 10:18:42,235 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:42,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:42,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:42,241 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-20 10:18:42,269 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 10:18:42,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-20 10:18:42,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:42,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:42,276 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:18:42,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-20 10:18:42,336 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 256 proven. 8 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-11-20 10:18:42,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:18:42,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-20 10:18:42,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085228868] [2019-11-20 10:18:42,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 10:18:42,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:42,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 10:18:42,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:18:42,338 INFO L87 Difference]: Start difference. First operand 1515 states and 2285 transitions. Second operand 9 states. [2019-11-20 10:18:43,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:43,407 INFO L93 Difference]: Finished difference Result 3263 states and 4885 transitions. [2019-11-20 10:18:43,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 10:18:43,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 224 [2019-11-20 10:18:43,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:43,410 INFO L225 Difference]: With dead ends: 3263 [2019-11-20 10:18:43,410 INFO L226 Difference]: Without dead ends: 1767 [2019-11-20 10:18:43,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 221 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-20 10:18:43,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-11-20 10:18:43,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1515. [2019-11-20 10:18:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2019-11-20 10:18:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2279 transitions. [2019-11-20 10:18:43,455 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2279 transitions. Word has length 224 [2019-11-20 10:18:43,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:43,455 INFO L462 AbstractCegarLoop]: Abstraction has 1515 states and 2279 transitions. [2019-11-20 10:18:43,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 10:18:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2279 transitions. [2019-11-20 10:18:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-20 10:18:43,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:43,457 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:43,657 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:18:43,658 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:43,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:43,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1838111843, now seen corresponding path program 1 times [2019-11-20 10:18:43,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:43,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745248770] [2019-11-20 10:18:43,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:43,796 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 256 proven. 80 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-20 10:18:43,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745248770] [2019-11-20 10:18:43,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832732207] [2019-11-20 10:18:43,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:18:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:43,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 10:18:43,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:18:43,999 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 25 treesize of output 21 [2019-11-20 10:18:44,003 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 24 treesize of output 16 [2019-11-20 10:18:44,003 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-20 10:18:44,008 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-20 10:18:44,008 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:44,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:44,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:44,010 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-20 10:18:44,020 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:18:44,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:44,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:44,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:44,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-20 10:18:44,027 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-11-20 10:18:44,037 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-20 10:18:44,037 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-20 10:18:44,037 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:44,046 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-20 10:18:44,046 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:44,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:44,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:44,050 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-20 10:18:44,075 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 10:18:44,075 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-20 10:18:44,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:44,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:44,078 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:18:44,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-20 10:18:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 259 proven. 7 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-11-20 10:18:44,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:18:44,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-20 10:18:44,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734544072] [2019-11-20 10:18:44,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 10:18:44,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:44,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 10:18:44,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:18:44,139 INFO L87 Difference]: Start difference. First operand 1515 states and 2279 transitions. Second operand 9 states. [2019-11-20 10:18:45,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:45,064 INFO L93 Difference]: Finished difference Result 3257 states and 4867 transitions. [2019-11-20 10:18:45,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 10:18:45,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 225 [2019-11-20 10:18:45,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:45,066 INFO L225 Difference]: With dead ends: 3257 [2019-11-20 10:18:45,066 INFO L226 Difference]: Without dead ends: 1761 [2019-11-20 10:18:45,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 222 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-20 10:18:45,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2019-11-20 10:18:45,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1515. [2019-11-20 10:18:45,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2019-11-20 10:18:45,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2273 transitions. [2019-11-20 10:18:45,113 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2273 transitions. Word has length 225 [2019-11-20 10:18:45,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:45,113 INFO L462 AbstractCegarLoop]: Abstraction has 1515 states and 2273 transitions. [2019-11-20 10:18:45,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 10:18:45,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2273 transitions. [2019-11-20 10:18:45,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-20 10:18:45,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:45,115 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:45,315 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:18:45,315 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:45,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:45,316 INFO L82 PathProgramCache]: Analyzing trace with hash 389258756, now seen corresponding path program 1 times [2019-11-20 10:18:45,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:45,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544876130] [2019-11-20 10:18:45,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:45,507 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 258 proven. 82 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:18:45,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544876130] [2019-11-20 10:18:45,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498619616] [2019-11-20 10:18:45,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:18:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:45,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 10:18:45,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:18:45,817 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 25 treesize of output 21 [2019-11-20 10:18:45,820 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 24 treesize of output 16 [2019-11-20 10:18:45,821 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-20 10:18:45,834 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-20 10:18:45,834 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:45,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:45,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:45,837 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-20 10:18:45,869 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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:18:45,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:45,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:45,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:45,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-20 10:18:45,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-11-20 10:18:45,909 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-20 10:18:45,910 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-20 10:18:45,910 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:45,928 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-20 10:18:45,929 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:45,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:45,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:45,936 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-20 10:18:45,962 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 10:18:45,962 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-20 10:18:45,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:45,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:45,965 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:18:45,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-20 10:18:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 262 proven. 6 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-11-20 10:18:46,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:18:46,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-20 10:18:46,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649170298] [2019-11-20 10:18:46,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 10:18:46,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:46,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 10:18:46,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:18:46,036 INFO L87 Difference]: Start difference. First operand 1515 states and 2273 transitions. Second operand 9 states. [2019-11-20 10:18:46,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:46,934 INFO L93 Difference]: Finished difference Result 3374 states and 5038 transitions. [2019-11-20 10:18:46,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 10:18:46,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 226 [2019-11-20 10:18:46,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:46,936 INFO L225 Difference]: With dead ends: 3374 [2019-11-20 10:18:46,936 INFO L226 Difference]: Without dead ends: 1878 [2019-11-20 10:18:46,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 223 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-20 10:18:46,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2019-11-20 10:18:46,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1626. [2019-11-20 10:18:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1626 states. [2019-11-20 10:18:46,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2444 transitions. [2019-11-20 10:18:46,983 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2444 transitions. Word has length 226 [2019-11-20 10:18:46,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:46,983 INFO L462 AbstractCegarLoop]: Abstraction has 1626 states and 2444 transitions. [2019-11-20 10:18:46,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 10:18:46,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2444 transitions. [2019-11-20 10:18:46,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-20 10:18:46,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:46,986 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:47,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:18:47,187 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:47,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:47,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1592292894, now seen corresponding path program 1 times [2019-11-20 10:18:47,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:47,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830459421] [2019-11-20 10:18:47,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 260 proven. 84 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-20 10:18:47,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830459421] [2019-11-20 10:18:47,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821732842] [2019-11-20 10:18:47,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:18:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:47,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 10:18:47,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:18:47,521 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 25 treesize of output 21 [2019-11-20 10:18:47,524 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 24 treesize of output 16 [2019-11-20 10:18:47,524 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-20 10:18:47,529 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-20 10:18:47,530 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:47,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:47,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:47,531 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-20 10:18:47,541 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:18:47,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:47,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:47,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:47,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-20 10:18:47,549 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-11-20 10:18:47,559 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-20 10:18:47,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-20 10:18:47,559 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:47,569 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-20 10:18:47,569 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:47,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:47,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:18:47,574 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-20 10:18:47,599 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 10:18:47,599 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-20 10:18:47,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:18:47,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:18:47,602 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:18:47,602 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-20 10:18:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 265 proven. 5 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-11-20 10:18:47,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:18:47,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-20 10:18:47,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687760328] [2019-11-20 10:18:47,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 10:18:47,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:47,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 10:18:47,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:18:47,648 INFO L87 Difference]: Start difference. First operand 1626 states and 2444 transitions. Second operand 9 states. [2019-11-20 10:18:48,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:48,540 INFO L93 Difference]: Finished difference Result 3479 states and 5197 transitions. [2019-11-20 10:18:48,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 10:18:48,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 227 [2019-11-20 10:18:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:48,542 INFO L225 Difference]: With dead ends: 3479 [2019-11-20 10:18:48,542 INFO L226 Difference]: Without dead ends: 1872 [2019-11-20 10:18:48,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 224 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-20 10:18:48,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2019-11-20 10:18:48,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1626. [2019-11-20 10:18:48,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1626 states. [2019-11-20 10:18:48,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2438 transitions. [2019-11-20 10:18:48,589 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2438 transitions. Word has length 227 [2019-11-20 10:18:48,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:48,589 INFO L462 AbstractCegarLoop]: Abstraction has 1626 states and 2438 transitions. [2019-11-20 10:18:48,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 10:18:48,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2438 transitions. [2019-11-20 10:18:48,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-20 10:18:48,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:48,591 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:48,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:18:48,791 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:48,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:48,791 INFO L82 PathProgramCache]: Analyzing trace with hash -939725387, now seen corresponding path program 1 times [2019-11-20 10:18:48,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:48,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956390920] [2019-11-20 10:18:48,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:48,868 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2019-11-20 10:18:48,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956390920] [2019-11-20 10:18:48,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:48,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:48,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168174668] [2019-11-20 10:18:48,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:48,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:48,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:48,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:48,869 INFO L87 Difference]: Start difference. First operand 1626 states and 2438 transitions. Second operand 4 states. [2019-11-20 10:18:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:49,188 INFO L93 Difference]: Finished difference Result 3413 states and 5117 transitions. [2019-11-20 10:18:49,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:49,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2019-11-20 10:18:49,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:49,190 INFO L225 Difference]: With dead ends: 3413 [2019-11-20 10:18:49,190 INFO L226 Difference]: Without dead ends: 1806 [2019-11-20 10:18:49,190 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:18:49,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2019-11-20 10:18:49,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1722. [2019-11-20 10:18:49,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2019-11-20 10:18:49,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 2591 transitions. [2019-11-20 10:18:49,250 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 2591 transitions. Word has length 227 [2019-11-20 10:18:49,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:49,250 INFO L462 AbstractCegarLoop]: Abstraction has 1722 states and 2591 transitions. [2019-11-20 10:18:49,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:49,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2591 transitions. [2019-11-20 10:18:49,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-20 10:18:49,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:49,253 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:49,253 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:49,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:49,253 INFO L82 PathProgramCache]: Analyzing trace with hash -544723992, now seen corresponding path program 1 times [2019-11-20 10:18:49,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:49,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190747191] [2019-11-20 10:18:49,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:49,369 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-20 10:18:49,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190747191] [2019-11-20 10:18:49,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:49,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:49,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842282951] [2019-11-20 10:18:49,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:49,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:49,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:49,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:49,370 INFO L87 Difference]: Start difference. First operand 1722 states and 2591 transitions. Second operand 4 states. [2019-11-20 10:18:49,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:49,672 INFO L93 Difference]: Finished difference Result 3509 states and 5268 transitions. [2019-11-20 10:18:49,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:49,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-11-20 10:18:49,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:49,674 INFO L225 Difference]: With dead ends: 3509 [2019-11-20 10:18:49,674 INFO L226 Difference]: Without dead ends: 1800 [2019-11-20 10:18:49,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:18:49,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2019-11-20 10:18:49,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1773. [2019-11-20 10:18:49,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2019-11-20 10:18:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2657 transitions. [2019-11-20 10:18:49,723 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2657 transitions. Word has length 228 [2019-11-20 10:18:49,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:49,723 INFO L462 AbstractCegarLoop]: Abstraction has 1773 states and 2657 transitions. [2019-11-20 10:18:49,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:49,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2657 transitions. [2019-11-20 10:18:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-20 10:18:49,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:49,725 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:49,725 INFO L410 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:49,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:49,726 INFO L82 PathProgramCache]: Analyzing trace with hash 293313977, now seen corresponding path program 1 times [2019-11-20 10:18:49,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:49,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297423849] [2019-11-20 10:18:49,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:49,812 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-11-20 10:18:49,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297423849] [2019-11-20 10:18:49,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:49,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:49,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675518443] [2019-11-20 10:18:49,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:49,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:49,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:49,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:49,814 INFO L87 Difference]: Start difference. First operand 1773 states and 2657 transitions. Second operand 4 states. [2019-11-20 10:18:50,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:50,151 INFO L93 Difference]: Finished difference Result 3608 states and 5396 transitions. [2019-11-20 10:18:50,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:50,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-11-20 10:18:50,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:50,153 INFO L225 Difference]: With dead ends: 3608 [2019-11-20 10:18:50,153 INFO L226 Difference]: Without dead ends: 1854 [2019-11-20 10:18:50,154 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:18:50,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2019-11-20 10:18:50,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1773. [2019-11-20 10:18:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2019-11-20 10:18:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2654 transitions. [2019-11-20 10:18:50,216 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2654 transitions. Word has length 229 [2019-11-20 10:18:50,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:50,216 INFO L462 AbstractCegarLoop]: Abstraction has 1773 states and 2654 transitions. [2019-11-20 10:18:50,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2654 transitions. [2019-11-20 10:18:50,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-20 10:18:50,218 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:50,218 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:50,218 INFO L410 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:50,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:50,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1684939052, now seen corresponding path program 1 times [2019-11-20 10:18:50,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:50,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010761739] [2019-11-20 10:18:50,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-11-20 10:18:50,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010761739] [2019-11-20 10:18:50,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:50,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:50,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201726591] [2019-11-20 10:18:50,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:50,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:50,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:50,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:50,305 INFO L87 Difference]: Start difference. First operand 1773 states and 2654 transitions. Second operand 4 states. [2019-11-20 10:18:50,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:50,619 INFO L93 Difference]: Finished difference Result 3608 states and 5390 transitions. [2019-11-20 10:18:50,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:50,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-11-20 10:18:50,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:50,621 INFO L225 Difference]: With dead ends: 3608 [2019-11-20 10:18:50,621 INFO L226 Difference]: Without dead ends: 1854 [2019-11-20 10:18:50,622 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:18:50,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2019-11-20 10:18:50,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1773. [2019-11-20 10:18:50,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2019-11-20 10:18:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2651 transitions. [2019-11-20 10:18:50,669 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2651 transitions. Word has length 230 [2019-11-20 10:18:50,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:50,669 INFO L462 AbstractCegarLoop]: Abstraction has 1773 states and 2651 transitions. [2019-11-20 10:18:50,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:50,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2651 transitions. [2019-11-20 10:18:50,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-20 10:18:50,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:50,671 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:50,671 INFO L410 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:50,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:50,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1048338210, now seen corresponding path program 1 times [2019-11-20 10:18:50,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:50,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922824611] [2019-11-20 10:18:50,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-11-20 10:18:50,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922824611] [2019-11-20 10:18:50,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:50,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:50,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126073048] [2019-11-20 10:18:50,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:50,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:50,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:50,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:50,737 INFO L87 Difference]: Start difference. First operand 1773 states and 2651 transitions. Second operand 4 states. [2019-11-20 10:18:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:51,039 INFO L93 Difference]: Finished difference Result 3608 states and 5384 transitions. [2019-11-20 10:18:51,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:51,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-11-20 10:18:51,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:51,041 INFO L225 Difference]: With dead ends: 3608 [2019-11-20 10:18:51,041 INFO L226 Difference]: Without dead ends: 1854 [2019-11-20 10:18:51,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:18:51,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2019-11-20 10:18:51,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1773. [2019-11-20 10:18:51,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2019-11-20 10:18:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2648 transitions. [2019-11-20 10:18:51,091 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2648 transitions. Word has length 231 [2019-11-20 10:18:51,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:51,092 INFO L462 AbstractCegarLoop]: Abstraction has 1773 states and 2648 transitions. [2019-11-20 10:18:51,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:51,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2648 transitions. [2019-11-20 10:18:51,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-20 10:18:51,093 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:51,093 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:51,094 INFO L410 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:51,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:51,094 INFO L82 PathProgramCache]: Analyzing trace with hash 526801537, now seen corresponding path program 1 times [2019-11-20 10:18:51,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:51,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330304448] [2019-11-20 10:18:51,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:51,320 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-20 10:18:51,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330304448] [2019-11-20 10:18:51,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:51,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 10:18:51,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219895718] [2019-11-20 10:18:51,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:18:51,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:51,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:18:51,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:18:51,322 INFO L87 Difference]: Start difference. First operand 1773 states and 2648 transitions. Second operand 5 states. [2019-11-20 10:18:52,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:52,128 INFO L93 Difference]: Finished difference Result 3961 states and 5895 transitions. [2019-11-20 10:18:52,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:18:52,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2019-11-20 10:18:52,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:52,131 INFO L225 Difference]: With dead ends: 3961 [2019-11-20 10:18:52,131 INFO L226 Difference]: Without dead ends: 2207 [2019-11-20 10:18:52,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:18:52,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2019-11-20 10:18:52,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 1908. [2019-11-20 10:18:52,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1908 states. [2019-11-20 10:18:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2870 transitions. [2019-11-20 10:18:52,210 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2870 transitions. Word has length 232 [2019-11-20 10:18:52,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:52,210 INFO L462 AbstractCegarLoop]: Abstraction has 1908 states and 2870 transitions. [2019-11-20 10:18:52,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:18:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2870 transitions. [2019-11-20 10:18:52,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-20 10:18:52,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:52,212 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:52,213 INFO L410 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:52,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:52,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1615058941, now seen corresponding path program 1 times [2019-11-20 10:18:52,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:52,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627110900] [2019-11-20 10:18:52,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:52,494 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-20 10:18:52,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627110900] [2019-11-20 10:18:52,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:52,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 10:18:52,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52026263] [2019-11-20 10:18:52,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 10:18:52,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:52,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 10:18:52,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:18:52,496 INFO L87 Difference]: Start difference. First operand 1908 states and 2870 transitions. Second operand 7 states. [2019-11-20 10:18:53,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:53,737 INFO L93 Difference]: Finished difference Result 5370 states and 8048 transitions. [2019-11-20 10:18:53,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 10:18:53,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 232 [2019-11-20 10:18:53,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:53,740 INFO L225 Difference]: With dead ends: 5370 [2019-11-20 10:18:53,740 INFO L226 Difference]: Without dead ends: 3481 [2019-11-20 10:18:53,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-11-20 10:18:53,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3481 states. [2019-11-20 10:18:53,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3481 to 3129. [2019-11-20 10:18:53,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2019-11-20 10:18:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 4723 transitions. [2019-11-20 10:18:53,842 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 4723 transitions. Word has length 232 [2019-11-20 10:18:53,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:53,842 INFO L462 AbstractCegarLoop]: Abstraction has 3129 states and 4723 transitions. [2019-11-20 10:18:53,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 10:18:53,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 4723 transitions. [2019-11-20 10:18:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-20 10:18:53,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:53,844 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:53,844 INFO L410 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:53,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:53,844 INFO L82 PathProgramCache]: Analyzing trace with hash -651462221, now seen corresponding path program 1 times [2019-11-20 10:18:53,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:53,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466387837] [2019-11-20 10:18:53,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-11-20 10:18:53,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466387837] [2019-11-20 10:18:53,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:53,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:53,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596601171] [2019-11-20 10:18:53,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:53,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:53,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:53,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:53,943 INFO L87 Difference]: Start difference. First operand 3129 states and 4723 transitions. Second operand 4 states. [2019-11-20 10:18:54,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:54,352 INFO L93 Difference]: Finished difference Result 6329 states and 9542 transitions. [2019-11-20 10:18:54,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:54,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-11-20 10:18:54,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:54,355 INFO L225 Difference]: With dead ends: 6329 [2019-11-20 10:18:54,355 INFO L226 Difference]: Without dead ends: 3219 [2019-11-20 10:18:54,357 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:18:54,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3219 states. [2019-11-20 10:18:54,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3219 to 3129. [2019-11-20 10:18:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2019-11-20 10:18:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 4717 transitions. [2019-11-20 10:18:54,445 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 4717 transitions. Word has length 232 [2019-11-20 10:18:54,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:54,445 INFO L462 AbstractCegarLoop]: Abstraction has 3129 states and 4717 transitions. [2019-11-20 10:18:54,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:54,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 4717 transitions. [2019-11-20 10:18:54,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-20 10:18:54,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:54,447 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:54,447 INFO L410 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:54,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:54,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1722133508, now seen corresponding path program 1 times [2019-11-20 10:18:54,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:54,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706358023] [2019-11-20 10:18:54,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-20 10:18:54,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706358023] [2019-11-20 10:18:54,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:54,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 10:18:54,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072816603] [2019-11-20 10:18:54,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:18:54,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:54,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:18:54,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:18:54,600 INFO L87 Difference]: Start difference. First operand 3129 states and 4717 transitions. Second operand 5 states. [2019-11-20 10:18:55,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:55,456 INFO L93 Difference]: Finished difference Result 6589 states and 9861 transitions. [2019-11-20 10:18:55,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:18:55,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 233 [2019-11-20 10:18:55,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:55,459 INFO L225 Difference]: With dead ends: 6589 [2019-11-20 10:18:55,459 INFO L226 Difference]: Without dead ends: 3479 [2019-11-20 10:18:55,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:18:55,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2019-11-20 10:18:55,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 3135. [2019-11-20 10:18:55,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2019-11-20 10:18:55,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 4717 transitions. [2019-11-20 10:18:55,552 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 4717 transitions. Word has length 233 [2019-11-20 10:18:55,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:55,552 INFO L462 AbstractCegarLoop]: Abstraction has 3135 states and 4717 transitions. [2019-11-20 10:18:55,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:18:55,552 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 4717 transitions. [2019-11-20 10:18:55,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-20 10:18:55,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:55,554 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:55,554 INFO L410 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:55,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:55,555 INFO L82 PathProgramCache]: Analyzing trace with hash 599668410, now seen corresponding path program 1 times [2019-11-20 10:18:55,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:55,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762970820] [2019-11-20 10:18:55,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-20 10:18:55,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762970820] [2019-11-20 10:18:55,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:55,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 10:18:55,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346577213] [2019-11-20 10:18:55,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 10:18:55,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:55,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 10:18:55,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:18:55,743 INFO L87 Difference]: Start difference. First operand 3135 states and 4717 transitions. Second operand 7 states. [2019-11-20 10:18:56,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:56,869 INFO L93 Difference]: Finished difference Result 7785 states and 11652 transitions. [2019-11-20 10:18:56,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 10:18:56,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 233 [2019-11-20 10:18:56,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:56,874 INFO L225 Difference]: With dead ends: 7785 [2019-11-20 10:18:56,874 INFO L226 Difference]: Without dead ends: 4669 [2019-11-20 10:18:56,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-11-20 10:18:56,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-11-20 10:18:57,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 3138. [2019-11-20 10:18:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2019-11-20 10:18:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 4723 transitions. [2019-11-20 10:18:57,007 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 4723 transitions. Word has length 233 [2019-11-20 10:18:57,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:57,007 INFO L462 AbstractCegarLoop]: Abstraction has 3138 states and 4723 transitions. [2019-11-20 10:18:57,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 10:18:57,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 4723 transitions. [2019-11-20 10:18:57,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-20 10:18:57,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:57,009 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:57,009 INFO L410 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:57,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:57,009 INFO L82 PathProgramCache]: Analyzing trace with hash -911411502, now seen corresponding path program 1 times [2019-11-20 10:18:57,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:57,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220785891] [2019-11-20 10:18:57,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:57,092 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-20 10:18:57,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220785891] [2019-11-20 10:18:57,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:57,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:57,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580118172] [2019-11-20 10:18:57,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:57,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:57,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:57,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:57,094 INFO L87 Difference]: Start difference. First operand 3138 states and 4723 transitions. Second operand 4 states. [2019-11-20 10:18:57,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:57,561 INFO L93 Difference]: Finished difference Result 6308 states and 9487 transitions. [2019-11-20 10:18:57,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:57,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 235 [2019-11-20 10:18:57,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:57,564 INFO L225 Difference]: With dead ends: 6308 [2019-11-20 10:18:57,564 INFO L226 Difference]: Without dead ends: 3189 [2019-11-20 10:18:57,566 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:18:57,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2019-11-20 10:18:57,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 3138. [2019-11-20 10:18:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2019-11-20 10:18:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 4717 transitions. [2019-11-20 10:18:57,659 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 4717 transitions. Word has length 235 [2019-11-20 10:18:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:57,659 INFO L462 AbstractCegarLoop]: Abstraction has 3138 states and 4717 transitions. [2019-11-20 10:18:57,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 4717 transitions. [2019-11-20 10:18:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-11-20 10:18:57,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:57,661 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:57,661 INFO L410 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:57,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:57,661 INFO L82 PathProgramCache]: Analyzing trace with hash 667655968, now seen corresponding path program 1 times [2019-11-20 10:18:57,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:57,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825054200] [2019-11-20 10:18:57,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-11-20 10:18:57,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825054200] [2019-11-20 10:18:57,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:57,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:57,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418001369] [2019-11-20 10:18:57,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:57,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:57,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:57,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:57,734 INFO L87 Difference]: Start difference. First operand 3138 states and 4717 transitions. Second operand 4 states. [2019-11-20 10:18:58,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:58,060 INFO L93 Difference]: Finished difference Result 6283 states and 9447 transitions. [2019-11-20 10:18:58,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:58,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-11-20 10:18:58,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:58,063 INFO L225 Difference]: With dead ends: 6283 [2019-11-20 10:18:58,063 INFO L226 Difference]: Without dead ends: 3164 [2019-11-20 10:18:58,065 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:18:58,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2019-11-20 10:18:58,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 3138. [2019-11-20 10:18:58,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2019-11-20 10:18:58,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 4714 transitions. [2019-11-20 10:18:58,166 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 4714 transitions. Word has length 236 [2019-11-20 10:18:58,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:58,167 INFO L462 AbstractCegarLoop]: Abstraction has 3138 states and 4714 transitions. [2019-11-20 10:18:58,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:58,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 4714 transitions. [2019-11-20 10:18:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-11-20 10:18:58,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:58,170 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:58,171 INFO L410 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:58,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:58,171 INFO L82 PathProgramCache]: Analyzing trace with hash 844462840, now seen corresponding path program 1 times [2019-11-20 10:18:58,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:58,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680758404] [2019-11-20 10:18:58,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-20 10:18:58,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680758404] [2019-11-20 10:18:58,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:58,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:58,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069686654] [2019-11-20 10:18:58,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:58,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:58,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:58,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:58,269 INFO L87 Difference]: Start difference. First operand 3138 states and 4714 transitions. Second operand 4 states. [2019-11-20 10:18:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:58,620 INFO L93 Difference]: Finished difference Result 6347 states and 9524 transitions. [2019-11-20 10:18:58,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:58,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2019-11-20 10:18:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:58,624 INFO L225 Difference]: With dead ends: 6347 [2019-11-20 10:18:58,624 INFO L226 Difference]: Without dead ends: 3228 [2019-11-20 10:18:58,626 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:18:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3228 states. [2019-11-20 10:18:58,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3228 to 3138. [2019-11-20 10:18:58,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2019-11-20 10:18:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 4708 transitions. [2019-11-20 10:18:58,728 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 4708 transitions. Word has length 242 [2019-11-20 10:18:58,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:58,729 INFO L462 AbstractCegarLoop]: Abstraction has 3138 states and 4708 transitions. [2019-11-20 10:18:58,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:58,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 4708 transitions. [2019-11-20 10:18:58,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-11-20 10:18:58,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:58,732 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:58,732 INFO L410 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:58,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:58,732 INFO L82 PathProgramCache]: Analyzing trace with hash -430767977, now seen corresponding path program 1 times [2019-11-20 10:18:58,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:58,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284656574] [2019-11-20 10:18:58,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:58,854 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2019-11-20 10:18:58,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284656574] [2019-11-20 10:18:58,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:58,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:58,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160235421] [2019-11-20 10:18:58,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:58,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:58,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:58,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:58,856 INFO L87 Difference]: Start difference. First operand 3138 states and 4708 transitions. Second operand 4 states. [2019-11-20 10:18:59,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:18:59,433 INFO L93 Difference]: Finished difference Result 6395 states and 9578 transitions. [2019-11-20 10:18:59,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:18:59,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2019-11-20 10:18:59,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:18:59,437 INFO L225 Difference]: With dead ends: 6395 [2019-11-20 10:18:59,437 INFO L226 Difference]: Without dead ends: 3276 [2019-11-20 10:18:59,449 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:18:59,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2019-11-20 10:18:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 3138. [2019-11-20 10:18:59,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2019-11-20 10:18:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 4702 transitions. [2019-11-20 10:18:59,558 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 4702 transitions. Word has length 242 [2019-11-20 10:18:59,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:18:59,559 INFO L462 AbstractCegarLoop]: Abstraction has 3138 states and 4702 transitions. [2019-11-20 10:18:59,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:18:59,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 4702 transitions. [2019-11-20 10:18:59,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-20 10:18:59,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:18:59,561 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:18:59,562 INFO L410 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:18:59,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:18:59,562 INFO L82 PathProgramCache]: Analyzing trace with hash 262669153, now seen corresponding path program 1 times [2019-11-20 10:18:59,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:18:59,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533799476] [2019-11-20 10:18:59,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:18:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:18:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-20 10:18:59,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533799476] [2019-11-20 10:18:59,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:18:59,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:18:59,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803305420] [2019-11-20 10:18:59,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:18:59,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:18:59,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:18:59,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:18:59,661 INFO L87 Difference]: Start difference. First operand 3138 states and 4702 transitions. Second operand 4 states. [2019-11-20 10:19:00,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:19:00,178 INFO L93 Difference]: Finished difference Result 6341 states and 9494 transitions. [2019-11-20 10:19:00,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:19:00,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2019-11-20 10:19:00,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:19:00,182 INFO L225 Difference]: With dead ends: 6341 [2019-11-20 10:19:00,182 INFO L226 Difference]: Without dead ends: 3222 [2019-11-20 10:19:00,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:19:00,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3222 states. [2019-11-20 10:19:00,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3222 to 3138. [2019-11-20 10:19:00,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2019-11-20 10:19:00,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 4696 transitions. [2019-11-20 10:19:00,286 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 4696 transitions. Word has length 243 [2019-11-20 10:19:00,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:19:00,286 INFO L462 AbstractCegarLoop]: Abstraction has 3138 states and 4696 transitions. [2019-11-20 10:19:00,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:19:00,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 4696 transitions. [2019-11-20 10:19:00,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-11-20 10:19:00,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:19:00,288 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:19:00,288 INFO L410 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:19:00,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:19:00,289 INFO L82 PathProgramCache]: Analyzing trace with hash -823623646, now seen corresponding path program 1 times [2019-11-20 10:19:00,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:19:00,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900905138] [2019-11-20 10:19:00,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:19:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:19:00,427 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 328 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-20 10:19:00,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900905138] [2019-11-20 10:19:00,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705943157] [2019-11-20 10:19:00,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:19:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:19:00,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 10:19:00,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:19:00,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-20 10:19:00,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:00,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:00,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:19:00,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-20 10:19:00,668 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_158|, |v_#memory_$Pointer$.base_158|], 5=[|v_#memory_int_199|]} [2019-11-20 10:19:00,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 81 treesize of output 69 [2019-11-20 10:19:00,670 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:19:00,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:00,674 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 69 treesize of output 51 [2019-11-20 10:19:00,675 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:19:00,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:00,719 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:00,720 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 141 [2019-11-20 10:19:00,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:19:00,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:19:00,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:19:00,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:19:00,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:19:00,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:19:00,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:19:00,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:19:00,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:19:00,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:19:00,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:19:00,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:19:00,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:19:00,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:19:00,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:19:00,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:19:00,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:19:00,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:19:00,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:19:00,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:19:00,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:19:00,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:19:00,955 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 10:19:00,958 INFO L168 Benchmark]: Toolchain (without parser) took 81389.78 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 944.7 MB in the beginning and 1.8 GB in the end (delta: -842.9 MB). Peak memory consumption was 371.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:19:00,958 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:19:00,959 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-20 10:19:00,959 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:19:00,959 INFO L168 Benchmark]: Boogie Preprocessor took 170.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 10:19:00,959 INFO L168 Benchmark]: RCFGBuilder took 1249.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.2 MB). Peak memory consumption was 92.2 MB. Max. memory is 11.5 GB. [2019-11-20 10:19:00,960 INFO L168 Benchmark]: TraceAbstraction took 79081.48 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -771.2 MB). Peak memory consumption was 295.2 MB. Max. memory is 11.5 GB. [2019-11-20 10:19:00,961 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 761.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 124.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 170.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1249.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.2 MB). Peak memory consumption was 92.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 79081.48 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -771.2 MB). Peak memory consumption was 295.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 10:19:02,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:19:02,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:19:02,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:19:02,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:19:02,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:19:02,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:19:02,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:19:02,860 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:19:02,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:19:02,863 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:19:02,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:19:02,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:19:02,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:19:02,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:19:02,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:19:02,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:19:02,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:19:02,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:19:02,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:19:02,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:19:02,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:19:02,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:19:02,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:19:02,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:19:02,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:19:02,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:19:02,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:19:02,891 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:19:02,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:19:02,893 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:19:02,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:19:02,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:19:02,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:19:02,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:19:02,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:19:02,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:19:02,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:19:02,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:19:02,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:19:02,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:19:02,903 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 10:19:02,929 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:19:02,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:19:02,939 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:19:02,939 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:19:02,940 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:19:02,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:19:02,940 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:19:02,940 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:19:02,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:19:02,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:19:02,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:19:02,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:19:02,943 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 10:19:02,943 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 10:19:02,943 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:19:02,943 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:19:02,944 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:19:02,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:19:02,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:19:02,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:19:02,945 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:19:02,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:19:02,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:19:02,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:19:02,946 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:19:02,946 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:19:02,946 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 10:19:02,947 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 10:19:02,947 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:19:02,948 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 10:19:02,948 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_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8531c852aede4d90d76778a05ed8837cee15399 [2019-11-20 10:19:03,259 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:19:03,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:19:03,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:19:03,284 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:19:03,284 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:19:03,285 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-2.c [2019-11-20 10:19:03,343 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/data/e5d0a0815/cf5dbdf7da564466830bad33d2cc1179/FLAGa0e009670 [2019-11-20 10:19:03,854 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:19:03,858 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-2.c [2019-11-20 10:19:03,890 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/data/e5d0a0815/cf5dbdf7da564466830bad33d2cc1179/FLAGa0e009670 [2019-11-20 10:19:04,064 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/bin/uautomizer/data/e5d0a0815/cf5dbdf7da564466830bad33d2cc1179 [2019-11-20 10:19:04,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:19:04,068 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:19:04,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:19:04,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:19:04,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:19:04,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:19:04" (1/1) ... [2019-11-20 10:19:04,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634da0c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:04, skipping insertion in model container [2019-11-20 10:19:04,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:19:04" (1/1) ... [2019-11-20 10:19:04,086 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:19:04,159 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:19:04,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:19:04,773 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:19:04,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:19:04,978 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:19:04,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:04 WrapperNode [2019-11-20 10:19:04,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:19:04,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:19:04,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:19:04,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:19:04,989 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:19:04" (1/1) ... [2019-11-20 10:19:05,034 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:19:04" (1/1) ... [2019-11-20 10:19:05,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:19:05,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:19:05,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:19:05,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:19:05,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:04" (1/1) ... [2019-11-20 10:19:05,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:04" (1/1) ... [2019-11-20 10:19:05,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:04" (1/1) ... [2019-11-20 10:19:05,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:04" (1/1) ... [2019-11-20 10:19:05,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:04" (1/1) ... [2019-11-20 10:19:05,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:04" (1/1) ... [2019-11-20 10:19:05,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:04" (1/1) ... [2019-11-20 10:19:05,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:19:05,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:19:05,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:19:05,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:19:05,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:19:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 10:19:05,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 10:19:05,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 10:19:05,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 10:19:05,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 10:19:05,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:19:05,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:19:05,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 10:19:05,698 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 10:19:08,683 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 10:19:08,683 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 10:19:08,684 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:19:08,685 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 10:19:08,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:19:08 BoogieIcfgContainer [2019-11-20 10:19:08,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:19:08,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:19:08,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:19:08,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:19:08,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:19:04" (1/3) ... [2019-11-20 10:19:08,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcc2f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:19:08, skipping insertion in model container [2019-11-20 10:19:08,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:04" (2/3) ... [2019-11-20 10:19:08,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcc2f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:19:08, skipping insertion in model container [2019-11-20 10:19:08,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:19:08" (3/3) ... [2019-11-20 10:19:08,694 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-2.c [2019-11-20 10:19:08,703 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:19:08,708 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 10:19:08,717 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 10:19:08,739 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:19:08,739 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 10:19:08,739 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:19:08,740 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:19:08,740 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:19:08,740 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:19:08,740 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:19:08,740 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:19:08,759 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-20 10:19:08,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:19:08,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:19:08,770 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:19:08,770 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:19:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:19:08,775 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-11-20 10:19:08,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:19:08,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [235331704] [2019-11-20 10:19:08,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:19:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:19:09,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:19:09,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:19:09,132 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:19:09,133 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:19:09,163 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:19:09,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [235331704] [2019-11-20 10:19:09,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:19:09,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 10:19:09,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814798316] [2019-11-20 10:19:09,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:19:09,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:19:09,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:19:09,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:19:09,190 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-20 10:19:09,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:19:09,360 INFO L93 Difference]: Finished difference Result 540 states and 917 transitions. [2019-11-20 10:19:09,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:19:09,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-20 10:19:09,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:19:09,377 INFO L225 Difference]: With dead ends: 540 [2019-11-20 10:19:09,378 INFO L226 Difference]: Without dead ends: 366 [2019-11-20 10:19:09,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:19:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-20 10:19:09,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2019-11-20 10:19:09,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-11-20 10:19:09,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 556 transitions. [2019-11-20 10:19:09,471 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 556 transitions. Word has length 45 [2019-11-20 10:19:09,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:19:09,472 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 556 transitions. [2019-11-20 10:19:09,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:19:09,473 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 556 transitions. [2019-11-20 10:19:09,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 10:19:09,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:19:09,484 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:19:09,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:19:09,687 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:19:09,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:19:09,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1984491269, now seen corresponding path program 1 times [2019-11-20 10:19:09,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:19:09,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [637334270] [2019-11-20 10:19:09,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:19:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:19:09,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:19:09,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:19:09,961 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:19:09,962 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:19:09,982 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:19:09,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [637334270] [2019-11-20 10:19:09,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:19:09,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 10:19:09,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922474435] [2019-11-20 10:19:09,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:19:09,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:19:09,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:19:09,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:19:09,986 INFO L87 Difference]: Start difference. First operand 366 states and 556 transitions. Second operand 3 states. [2019-11-20 10:19:10,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:19:10,301 INFO L93 Difference]: Finished difference Result 721 states and 1100 transitions. [2019-11-20 10:19:10,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:19:10,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-20 10:19:10,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:19:10,306 INFO L225 Difference]: With dead ends: 721 [2019-11-20 10:19:10,306 INFO L226 Difference]: Without dead ends: 482 [2019-11-20 10:19:10,308 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:19:10,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-20 10:19:10,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-11-20 10:19:10,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-11-20 10:19:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 731 transitions. [2019-11-20 10:19:10,345 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 731 transitions. Word has length 85 [2019-11-20 10:19:10,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:19:10,346 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 731 transitions. [2019-11-20 10:19:10,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:19:10,348 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 731 transitions. [2019-11-20 10:19:10,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 10:19:10,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:19:10,350 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] [2019-11-20 10:19:10,552 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:19:10,553 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:19:10,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:19:10,553 INFO L82 PathProgramCache]: Analyzing trace with hash 20336871, now seen corresponding path program 1 times [2019-11-20 10:19:10,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:19:10,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [28900414] [2019-11-20 10:19:10,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:19:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:19:10,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:19:10,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:19:10,836 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:19:10,837 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:19:10,921 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:19:10,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [28900414] [2019-11-20 10:19:10,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:19:10,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 10:19:10,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268230944] [2019-11-20 10:19:10,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:19:10,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:19:10,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:19:10,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:19:10,928 INFO L87 Difference]: Start difference. First operand 482 states and 731 transitions. Second operand 4 states. [2019-11-20 10:19:11,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:19:11,220 INFO L93 Difference]: Finished difference Result 1072 states and 1634 transitions. [2019-11-20 10:19:11,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:19:11,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-20 10:19:11,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:19:11,225 INFO L225 Difference]: With dead ends: 1072 [2019-11-20 10:19:11,225 INFO L226 Difference]: Without dead ends: 717 [2019-11-20 10:19:11,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:19:11,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-11-20 10:19:11,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-11-20 10:19:11,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-11-20 10:19:11,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1087 transitions. [2019-11-20 10:19:11,280 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1087 transitions. Word has length 107 [2019-11-20 10:19:11,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:19:11,280 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1087 transitions. [2019-11-20 10:19:11,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:19:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1087 transitions. [2019-11-20 10:19:11,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 10:19:11,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:19:11,283 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:19:11,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:19:11,489 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:19:11,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:19:11,490 INFO L82 PathProgramCache]: Analyzing trace with hash 856260688, now seen corresponding path program 1 times [2019-11-20 10:19:11,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:19:11,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1341568621] [2019-11-20 10:19:11,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:19:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:19:12,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 10:19:12,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:19:12,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:19:12,879 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 18 treesize of output 19 [2019-11-20 10:19:12,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:12,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:12,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:19:12,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 10:19:12,943 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:12,943 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 10:19:12,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:12,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:12,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:19:12,947 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 10:19:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:19:13,000 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:19:13,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-20 10:19:13,053 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:13,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:13,055 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:19:13,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:13,056 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:19:13,056 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 10:19:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:19:13,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1341568621] [2019-11-20 10:19:13,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:19:13,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 10:19:13,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330735545] [2019-11-20 10:19:13,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:19:13,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:19:13,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:19:13,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:19:13,089 INFO L87 Difference]: Start difference. First operand 717 states and 1087 transitions. Second operand 4 states. [2019-11-20 10:19:16,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:19:16,475 INFO L93 Difference]: Finished difference Result 2093 states and 3189 transitions. [2019-11-20 10:19:16,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:19:16,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-20 10:19:16,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:19:16,484 INFO L225 Difference]: With dead ends: 2093 [2019-11-20 10:19:16,485 INFO L226 Difference]: Without dead ends: 1384 [2019-11-20 10:19:16,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:19:16,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2019-11-20 10:19:16,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 849. [2019-11-20 10:19:16,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-11-20 10:19:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1315 transitions. [2019-11-20 10:19:16,522 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1315 transitions. Word has length 148 [2019-11-20 10:19:16,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:19:16,522 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1315 transitions. [2019-11-20 10:19:16,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:19:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1315 transitions. [2019-11-20 10:19:16,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 10:19:16,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:19:16,525 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:19:16,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:19:16,732 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:19:16,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:19:16,732 INFO L82 PathProgramCache]: Analyzing trace with hash -670623159, now seen corresponding path program 1 times [2019-11-20 10:19:16,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:19:16,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [894535006] [2019-11-20 10:19:16,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:19:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:19:17,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 10:19:17,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:19:17,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:19:17,642 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 18 treesize of output 19 [2019-11-20 10:19:17,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:17,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:17,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:19:17,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 10:19:17,689 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:17,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 10:19:17,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:17,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:17,693 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:19:17,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 10:19:17,747 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 132 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:19:17,747 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:19:17,785 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 22 treesize of output 20 [2019-11-20 10:19:17,788 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:17,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:17,790 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:19:17,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:17,791 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:19:17,791 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 10:19:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:19:17,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [894535006] [2019-11-20 10:19:17,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:19:17,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 10:19:17,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312532117] [2019-11-20 10:19:17,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:19:17,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:19:17,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:19:17,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:19:17,838 INFO L87 Difference]: Start difference. First operand 849 states and 1315 transitions. Second operand 4 states. [2019-11-20 10:19:21,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:19:21,283 INFO L93 Difference]: Finished difference Result 2330 states and 3600 transitions. [2019-11-20 10:19:21,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:19:21,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-20 10:19:21,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:19:21,294 INFO L225 Difference]: With dead ends: 2330 [2019-11-20 10:19:21,295 INFO L226 Difference]: Without dead ends: 1489 [2019-11-20 10:19:21,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:19:21,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2019-11-20 10:19:21,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 965. [2019-11-20 10:19:21,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-11-20 10:19:21,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1516 transitions. [2019-11-20 10:19:21,340 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1516 transitions. Word has length 149 [2019-11-20 10:19:21,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:19:21,341 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1516 transitions. [2019-11-20 10:19:21,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:19:21,341 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1516 transitions. [2019-11-20 10:19:21,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-20 10:19:21,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:19:21,346 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:19:21,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:19:21,554 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:19:21,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:19:21,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2100849831, now seen corresponding path program 1 times [2019-11-20 10:19:21,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:19:21,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [78036439] [2019-11-20 10:19:21,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:19:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:19:22,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 10:19:22,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:19:22,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:19:22,927 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 18 treesize of output 19 [2019-11-20 10:19:22,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:22,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:22,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:19:22,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 10:19:22,965 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:22,966 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 10:19:22,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:22,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:22,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:19:22,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 10:19:23,016 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 181 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-20 10:19:23,016 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:19:23,053 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 22 treesize of output 20 [2019-11-20 10:19:23,056 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:23,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:23,061 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:19:23,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:23,065 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:19:23,065 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 10:19:23,088 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-20 10:19:23,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [78036439] [2019-11-20 10:19:23,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:19:23,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 10:19:23,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150925293] [2019-11-20 10:19:23,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:19:23,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:19:23,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:19:23,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:19:23,090 INFO L87 Difference]: Start difference. First operand 965 states and 1516 transitions. Second operand 4 states. [2019-11-20 10:19:27,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:19:27,234 INFO L93 Difference]: Finished difference Result 2444 states and 3813 transitions. [2019-11-20 10:19:27,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:19:27,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-20 10:19:27,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:19:27,246 INFO L225 Difference]: With dead ends: 2444 [2019-11-20 10:19:27,246 INFO L226 Difference]: Without dead ends: 1627 [2019-11-20 10:19:27,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:19:27,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2019-11-20 10:19:27,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1079. [2019-11-20 10:19:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-20 10:19:27,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1703 transitions. [2019-11-20 10:19:27,292 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1703 transitions. Word has length 165 [2019-11-20 10:19:27,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:19:27,293 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1703 transitions. [2019-11-20 10:19:27,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:19:27,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1703 transitions. [2019-11-20 10:19:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-20 10:19:27,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:19:27,297 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:19:27,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:19:27,504 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:19:27,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:19:27,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1366456425, now seen corresponding path program 1 times [2019-11-20 10:19:27,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:19:27,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1787945491] [2019-11-20 10:19:27,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:19:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:19:28,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 10:19:28,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:19:28,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:19:28,554 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 18 treesize of output 19 [2019-11-20 10:19:28,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:28,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:28,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:19:28,565 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 10:19:28,586 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:28,586 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 10:19:28,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:28,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:28,589 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:19:28,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 10:19:28,631 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 186 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-20 10:19:28,631 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:19:28,662 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 22 treesize of output 20 [2019-11-20 10:19:28,665 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:28,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:28,667 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:19:28,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:28,668 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:19:28,668 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 10:19:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-20 10:19:28,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1787945491] [2019-11-20 10:19:28,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:19:28,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 10:19:28,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381369388] [2019-11-20 10:19:28,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:19:28,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:19:28,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:19:28,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:19:28,738 INFO L87 Difference]: Start difference. First operand 1079 states and 1703 transitions. Second operand 4 states. [2019-11-20 10:19:32,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:19:32,168 INFO L93 Difference]: Finished difference Result 2550 states and 3977 transitions. [2019-11-20 10:19:32,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:19:32,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-20 10:19:32,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:19:32,179 INFO L225 Difference]: With dead ends: 2550 [2019-11-20 10:19:32,180 INFO L226 Difference]: Without dead ends: 1638 [2019-11-20 10:19:32,181 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:19:32,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2019-11-20 10:19:32,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1096. [2019-11-20 10:19:32,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2019-11-20 10:19:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1724 transitions. [2019-11-20 10:19:32,232 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1724 transitions. Word has length 166 [2019-11-20 10:19:32,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:19:32,232 INFO L462 AbstractCegarLoop]: Abstraction has 1096 states and 1724 transitions. [2019-11-20 10:19:32,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:19:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1724 transitions. [2019-11-20 10:19:32,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-20 10:19:32,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:19:32,237 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:19:32,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:19:32,452 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:19:32,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:19:32,453 INFO L82 PathProgramCache]: Analyzing trace with hash 312464066, now seen corresponding path program 1 times [2019-11-20 10:19:32,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:19:32,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1945801378] [2019-11-20 10:19:32,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:19:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:19:33,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 10:19:33,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:19:33,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:19:33,559 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 18 treesize of output 19 [2019-11-20 10:19:33,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:33,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:33,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:19:33,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 10:19:33,613 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:33,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 10:19:33,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:33,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:33,616 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:19:33,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 10:19:33,647 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 190 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-20 10:19:33,647 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:19:33,677 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 22 treesize of output 20 [2019-11-20 10:19:33,680 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:33,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:33,682 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:19:33,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:33,683 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:19:33,683 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 10:19:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-20 10:19:33,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1945801378] [2019-11-20 10:19:33,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:19:33,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 10:19:33,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572352129] [2019-11-20 10:19:33,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:19:33,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:19:33,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:19:33,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:19:33,708 INFO L87 Difference]: Start difference. First operand 1096 states and 1724 transitions. Second operand 4 states. [2019-11-20 10:19:37,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:19:37,681 INFO L93 Difference]: Finished difference Result 2675 states and 4164 transitions. [2019-11-20 10:19:37,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:19:37,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-11-20 10:19:37,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:19:37,692 INFO L225 Difference]: With dead ends: 2675 [2019-11-20 10:19:37,692 INFO L226 Difference]: Without dead ends: 1758 [2019-11-20 10:19:37,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:19:37,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2019-11-20 10:19:37,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1222. [2019-11-20 10:19:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-11-20 10:19:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1923 transitions. [2019-11-20 10:19:37,752 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1923 transitions. Word has length 167 [2019-11-20 10:19:37,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:19:37,752 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 1923 transitions. [2019-11-20 10:19:37,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:19:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1923 transitions. [2019-11-20 10:19:37,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-20 10:19:37,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:19:37,757 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:19:37,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:19:37,973 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:19:37,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:19:37,973 INFO L82 PathProgramCache]: Analyzing trace with hash 765984004, now seen corresponding path program 1 times [2019-11-20 10:19:37,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:19:37,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [584231981] [2019-11-20 10:19:37,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:19:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:19:38,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 10:19:38,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:19:39,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:19:39,005 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 18 treesize of output 19 [2019-11-20 10:19:39,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:39,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:39,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:19:39,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 10:19:39,035 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:39,035 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 10:19:39,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:39,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:39,042 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:19:39,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 10:19:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 212 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-20 10:19:39,112 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:19:39,144 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 22 treesize of output 20 [2019-11-20 10:19:39,146 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:39,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:39,147 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:19:39,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:39,148 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:19:39,148 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 10:19:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-20 10:19:39,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [584231981] [2019-11-20 10:19:39,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:19:39,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 10:19:39,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391492534] [2019-11-20 10:19:39,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:19:39,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:19:39,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:19:39,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:19:39,172 INFO L87 Difference]: Start difference. First operand 1222 states and 1923 transitions. Second operand 4 states. [2019-11-20 10:19:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:19:42,694 INFO L93 Difference]: Finished difference Result 3069 states and 4781 transitions. [2019-11-20 10:19:42,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:19:42,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-20 10:19:42,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:19:42,705 INFO L225 Difference]: With dead ends: 3069 [2019-11-20 10:19:42,705 INFO L226 Difference]: Without dead ends: 1866 [2019-11-20 10:19:42,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:19:42,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2019-11-20 10:19:42,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1414. [2019-11-20 10:19:42,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-11-20 10:19:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2241 transitions. [2019-11-20 10:19:42,766 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2241 transitions. Word has length 177 [2019-11-20 10:19:42,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:19:42,766 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 2241 transitions. [2019-11-20 10:19:42,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:19:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2241 transitions. [2019-11-20 10:19:42,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-20 10:19:42,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:19:42,771 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:19:42,981 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:19:42,981 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:19:42,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:19:42,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1311943816, now seen corresponding path program 1 times [2019-11-20 10:19:42,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:19:42,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [32464133] [2019-11-20 10:19:42,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:19:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:19:44,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 10:19:44,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:19:44,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:19:44,373 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 18 treesize of output 19 [2019-11-20 10:19:44,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:44,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:44,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:19:44,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 10:19:44,400 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:44,400 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 10:19:44,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:44,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:44,403 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:19:44,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 10:19:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 186 proven. 3 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-20 10:19:44,433 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:19:44,470 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 22 treesize of output 20 [2019-11-20 10:19:44,472 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:44,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:44,473 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:19:44,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:44,474 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:19:44,474 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 10:19:44,493 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-20 10:19:44,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [32464133] [2019-11-20 10:19:44,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:19:44,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 10:19:44,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418601983] [2019-11-20 10:19:44,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:19:44,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:19:44,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:19:44,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:19:44,494 INFO L87 Difference]: Start difference. First operand 1414 states and 2241 transitions. Second operand 4 states. [2019-11-20 10:19:47,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:19:47,837 INFO L93 Difference]: Finished difference Result 3327 states and 5219 transitions. [2019-11-20 10:19:47,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:19:47,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-11-20 10:19:47,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:19:47,848 INFO L225 Difference]: With dead ends: 3327 [2019-11-20 10:19:47,848 INFO L226 Difference]: Without dead ends: 1932 [2019-11-20 10:19:47,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:19:47,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2019-11-20 10:19:47,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1414. [2019-11-20 10:19:47,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-11-20 10:19:47,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2211 transitions. [2019-11-20 10:19:47,907 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2211 transitions. Word has length 180 [2019-11-20 10:19:47,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:19:47,907 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 2211 transitions. [2019-11-20 10:19:47,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:19:47,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2211 transitions. [2019-11-20 10:19:47,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-20 10:19:47,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:19:47,912 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:19:48,128 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:19:48,128 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:19:48,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:19:48,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1265222796, now seen corresponding path program 1 times [2019-11-20 10:19:48,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:19:48,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [919209077] [2019-11-20 10:19:48,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:19:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:19:49,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 10:19:49,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:19:49,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:19:49,498 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 18 treesize of output 19 [2019-11-20 10:19:49,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:49,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:49,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:19:49,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 10:19:49,527 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:49,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 10:19:49,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:49,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:49,530 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:19:49,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 10:19:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 192 proven. 3 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-20 10:19:49,591 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:19:49,612 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 22 treesize of output 20 [2019-11-20 10:19:49,615 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:49,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:49,616 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:19:49,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:49,616 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:19:49,617 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 10:19:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-20 10:19:49,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [919209077] [2019-11-20 10:19:49,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:19:49,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 10:19:49,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928915097] [2019-11-20 10:19:49,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:19:49,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:19:49,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:19:49,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:19:49,636 INFO L87 Difference]: Start difference. First operand 1414 states and 2211 transitions. Second operand 4 states. [2019-11-20 10:19:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:19:54,282 INFO L93 Difference]: Finished difference Result 3327 states and 5160 transitions. [2019-11-20 10:19:54,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:19:54,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-11-20 10:19:54,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:19:54,293 INFO L225 Difference]: With dead ends: 3327 [2019-11-20 10:19:54,293 INFO L226 Difference]: Without dead ends: 1932 [2019-11-20 10:19:54,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:19:54,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2019-11-20 10:19:54,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1414. [2019-11-20 10:19:54,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-11-20 10:19:54,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2181 transitions. [2019-11-20 10:19:54,357 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2181 transitions. Word has length 180 [2019-11-20 10:19:54,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:19:54,358 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 2181 transitions. [2019-11-20 10:19:54,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:19:54,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2181 transitions. [2019-11-20 10:19:54,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-20 10:19:54,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:19:54,363 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:19:54,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:19:54,571 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:19:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:19:54,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1754216307, now seen corresponding path program 1 times [2019-11-20 10:19:54,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:19:54,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1966493783] [2019-11-20 10:19:54,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:19:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:19:55,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 10:19:55,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:19:55,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:19:55,892 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 18 treesize of output 19 [2019-11-20 10:19:55,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:55,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:55,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:19:55,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 10:19:55,932 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:55,932 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 10:19:55,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:55,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:55,936 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:19:55,936 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 10:19:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 198 proven. 3 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-20 10:19:55,976 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:19:56,013 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 22 treesize of output 20 [2019-11-20 10:19:56,015 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:19:56,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:56,017 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:19:56,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:19:56,018 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:19:56,018 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 10:19:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-20 10:19:56,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1966493783] [2019-11-20 10:19:56,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:19:56,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 10:19:56,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000452676] [2019-11-20 10:19:56,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:19:56,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:19:56,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:19:56,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:19:56,042 INFO L87 Difference]: Start difference. First operand 1414 states and 2181 transitions. Second operand 4 states. [2019-11-20 10:20:00,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:00,486 INFO L93 Difference]: Finished difference Result 3327 states and 5101 transitions. [2019-11-20 10:20:00,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:00,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-20 10:20:00,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:00,498 INFO L225 Difference]: With dead ends: 3327 [2019-11-20 10:20:00,499 INFO L226 Difference]: Without dead ends: 1932 [2019-11-20 10:20:00,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:20:00,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2019-11-20 10:20:00,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1414. [2019-11-20 10:20:00,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-11-20 10:20:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2151 transitions. [2019-11-20 10:20:00,581 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2151 transitions. Word has length 181 [2019-11-20 10:20:00,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:00,581 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 2151 transitions. [2019-11-20 10:20:00,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:00,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2151 transitions. [2019-11-20 10:20:00,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-20 10:20:00,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:00,587 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:00,796 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:20:00,797 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:00,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:00,797 INFO L82 PathProgramCache]: Analyzing trace with hash 664544815, now seen corresponding path program 1 times [2019-11-20 10:20:00,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:20:00,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [690928963] [2019-11-20 10:20:00,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:20:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:02,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 10:20:02,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:20:02,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:02,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-20 10:20:02,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:02,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:02,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:02,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 10:20:02,162 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:02,163 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 10:20:02,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:02,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:02,167 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:20:02,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 10:20:02,198 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 204 proven. 3 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-20 10:20:02,199 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:20:02,235 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 22 treesize of output 20 [2019-11-20 10:20:02,237 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:02,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:02,238 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:02,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:02,239 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:20:02,240 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 10:20:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-20 10:20:02,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [690928963] [2019-11-20 10:20:02,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:20:02,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 10:20:02,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673210415] [2019-11-20 10:20:02,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:02,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:20:02,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:02,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:20:02,261 INFO L87 Difference]: Start difference. First operand 1414 states and 2151 transitions. Second operand 4 states. [2019-11-20 10:20:06,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:06,694 INFO L93 Difference]: Finished difference Result 3327 states and 5042 transitions. [2019-11-20 10:20:06,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:06,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-20 10:20:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:06,702 INFO L225 Difference]: With dead ends: 3327 [2019-11-20 10:20:06,702 INFO L226 Difference]: Without dead ends: 1932 [2019-11-20 10:20:06,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:20:06,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2019-11-20 10:20:06,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1414. [2019-11-20 10:20:06,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-11-20 10:20:06,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2121 transitions. [2019-11-20 10:20:06,771 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2121 transitions. Word has length 182 [2019-11-20 10:20:06,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:06,772 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 2121 transitions. [2019-11-20 10:20:06,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:06,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2121 transitions. [2019-11-20 10:20:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-20 10:20:06,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:06,776 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:06,985 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:20:06,985 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:06,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:06,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1265580952, now seen corresponding path program 1 times [2019-11-20 10:20:06,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:20:06,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [762981990] [2019-11-20 10:20:06,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:20:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:08,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 10:20:08,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:20:08,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:08,474 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 18 treesize of output 19 [2019-11-20 10:20:08,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:08,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:08,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:08,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 10:20:08,515 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:08,515 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 10:20:08,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:08,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:08,521 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:20:08,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 10:20:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 210 proven. 3 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-20 10:20:08,563 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:20:08,592 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 22 treesize of output 20 [2019-11-20 10:20:08,594 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:08,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:08,595 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:08,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:08,596 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:20:08,596 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 10:20:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-20 10:20:08,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [762981990] [2019-11-20 10:20:08,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:20:08,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 10:20:08,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546331096] [2019-11-20 10:20:08,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:08,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:20:08,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:08,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:20:08,625 INFO L87 Difference]: Start difference. First operand 1414 states and 2121 transitions. Second operand 4 states. [2019-11-20 10:20:13,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:13,761 INFO L93 Difference]: Finished difference Result 3267 states and 4905 transitions. [2019-11-20 10:20:13,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:13,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-11-20 10:20:13,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:13,769 INFO L225 Difference]: With dead ends: 3267 [2019-11-20 10:20:13,769 INFO L226 Difference]: Without dead ends: 1872 [2019-11-20 10:20:13,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:20:13,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2019-11-20 10:20:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1414. [2019-11-20 10:20:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-11-20 10:20:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2091 transitions. [2019-11-20 10:20:13,888 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2091 transitions. Word has length 183 [2019-11-20 10:20:13,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:13,889 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 2091 transitions. [2019-11-20 10:20:13,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2091 transitions. [2019-11-20 10:20:13,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-20 10:20:13,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:13,894 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:14,102 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:20:14,102 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:14,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:14,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1755228501, now seen corresponding path program 1 times [2019-11-20 10:20:14,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:20:14,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [804751415] [2019-11-20 10:20:14,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:20:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:15,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 10:20:15,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:20:15,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:15,450 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 18 treesize of output 19 [2019-11-20 10:20:15,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:15,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:15,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:15,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 10:20:15,478 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:15,478 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 10:20:15,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:15,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:15,480 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:20:15,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 10:20:15,513 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 229 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 10:20:15,514 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:20:15,533 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 22 treesize of output 20 [2019-11-20 10:20:15,535 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:15,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:15,536 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:15,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:15,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:20:15,537 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 10:20:15,554 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 10:20:15,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [804751415] [2019-11-20 10:20:15,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:20:15,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 10:20:15,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944141455] [2019-11-20 10:20:15,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:15,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:20:15,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:15,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:20:15,555 INFO L87 Difference]: Start difference. First operand 1414 states and 2091 transitions. Second operand 4 states. [2019-11-20 10:20:19,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:19,808 INFO L93 Difference]: Finished difference Result 3459 states and 5134 transitions. [2019-11-20 10:20:19,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:19,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-11-20 10:20:19,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:19,818 INFO L225 Difference]: With dead ends: 3459 [2019-11-20 10:20:19,819 INFO L226 Difference]: Without dead ends: 2064 [2019-11-20 10:20:19,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:20:19,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2019-11-20 10:20:19,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1510. [2019-11-20 10:20:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2019-11-20 10:20:19,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2193 transitions. [2019-11-20 10:20:19,891 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2193 transitions. Word has length 190 [2019-11-20 10:20:19,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:19,892 INFO L462 AbstractCegarLoop]: Abstraction has 1510 states and 2193 transitions. [2019-11-20 10:20:19,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:19,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2193 transitions. [2019-11-20 10:20:19,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-20 10:20:19,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:19,896 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:20,103 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:20:20,103 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:20,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:20,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1383000558, now seen corresponding path program 1 times [2019-11-20 10:20:20,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:20:20,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [513337944] [2019-11-20 10:20:20,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:20:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:21,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 10:20:21,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:20:21,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:21,343 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 18 treesize of output 19 [2019-11-20 10:20:21,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:21,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:21,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:21,353 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 10:20:21,370 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:21,370 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 10:20:21,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:21,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:21,373 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:20:21,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 10:20:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 235 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 10:20:21,408 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:20:21,457 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 22 treesize of output 20 [2019-11-20 10:20:21,459 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:21,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:21,459 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:21,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:21,460 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:20:21,460 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 10:20:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 10:20:21,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [513337944] [2019-11-20 10:20:21,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:20:21,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 10:20:21,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085087833] [2019-11-20 10:20:21,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:21,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:20:21,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:21,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:20:21,486 INFO L87 Difference]: Start difference. First operand 1510 states and 2193 transitions. Second operand 4 states. [2019-11-20 10:20:24,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:24,543 INFO L93 Difference]: Finished difference Result 3459 states and 5051 transitions. [2019-11-20 10:20:24,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:24,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-11-20 10:20:24,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:24,553 INFO L225 Difference]: With dead ends: 3459 [2019-11-20 10:20:24,553 INFO L226 Difference]: Without dead ends: 1968 [2019-11-20 10:20:24,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:20:24,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2019-11-20 10:20:24,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1510. [2019-11-20 10:20:24,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2019-11-20 10:20:24,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2163 transitions. [2019-11-20 10:20:24,612 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2163 transitions. Word has length 191 [2019-11-20 10:20:24,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:24,612 INFO L462 AbstractCegarLoop]: Abstraction has 1510 states and 2163 transitions. [2019-11-20 10:20:24,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:24,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2163 transitions. [2019-11-20 10:20:24,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-20 10:20:24,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:24,615 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:24,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:20:24,822 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:24,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:24,823 INFO L82 PathProgramCache]: Analyzing trace with hash 424593642, now seen corresponding path program 1 times [2019-11-20 10:20:24,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:20:24,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1126586767] [2019-11-20 10:20:24,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:20:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:25,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 10:20:25,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:20:25,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:25,920 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 18 treesize of output 19 [2019-11-20 10:20:25,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:25,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:25,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:25,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 10:20:25,950 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:25,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 10:20:25,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:25,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:25,952 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:20:25,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 10:20:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 276 proven. 1 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-11-20 10:20:26,002 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:20:26,022 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 22 treesize of output 20 [2019-11-20 10:20:26,027 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:26,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:26,029 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:26,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:26,030 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:20:26,030 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 10:20:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-11-20 10:20:26,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1126586767] [2019-11-20 10:20:26,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:20:26,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 10:20:26,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932088164] [2019-11-20 10:20:26,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:26,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:20:26,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:26,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:20:26,056 INFO L87 Difference]: Start difference. First operand 1510 states and 2163 transitions. Second operand 4 states. [2019-11-20 10:20:29,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:29,162 INFO L93 Difference]: Finished difference Result 3597 states and 5166 transitions. [2019-11-20 10:20:29,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:29,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-11-20 10:20:29,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:29,173 INFO L225 Difference]: With dead ends: 3597 [2019-11-20 10:20:29,173 INFO L226 Difference]: Without dead ends: 2106 [2019-11-20 10:20:29,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:20:29,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2019-11-20 10:20:29,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 1708. [2019-11-20 10:20:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1708 states. [2019-11-20 10:20:29,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2451 transitions. [2019-11-20 10:20:29,251 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2451 transitions. Word has length 198 [2019-11-20 10:20:29,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:29,252 INFO L462 AbstractCegarLoop]: Abstraction has 1708 states and 2451 transitions. [2019-11-20 10:20:29,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2451 transitions. [2019-11-20 10:20:29,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-20 10:20:29,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:29,254 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:29,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:20:29,455 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:29,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:29,455 INFO L82 PathProgramCache]: Analyzing trace with hash 898986440, now seen corresponding path program 1 times [2019-11-20 10:20:29,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:20:29,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [995512696] [2019-11-20 10:20:29,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:20:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:30,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 10:20:30,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:20:30,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:30,599 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 18 treesize of output 19 [2019-11-20 10:20:30,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:30,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:30,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:30,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 10:20:30,630 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:30,630 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 10:20:30,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:30,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:30,632 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:20:30,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 10:20:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 278 proven. 1 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-11-20 10:20:30,687 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:20:30,708 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 22 treesize of output 20 [2019-11-20 10:20:30,710 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:30,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:30,711 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:30,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:30,711 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:20:30,712 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 10:20:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-11-20 10:20:30,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [995512696] [2019-11-20 10:20:30,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:20:30,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 10:20:30,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831369625] [2019-11-20 10:20:30,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:30,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:20:30,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:30,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:20:30,783 INFO L87 Difference]: Start difference. First operand 1708 states and 2451 transitions. Second operand 4 states. [2019-11-20 10:20:34,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:34,483 INFO L93 Difference]: Finished difference Result 3855 states and 5568 transitions. [2019-11-20 10:20:34,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:34,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-11-20 10:20:34,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:34,489 INFO L225 Difference]: With dead ends: 3855 [2019-11-20 10:20:34,489 INFO L226 Difference]: Without dead ends: 2166 [2019-11-20 10:20:34,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:20:34,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2019-11-20 10:20:34,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 1774. [2019-11-20 10:20:34,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1774 states. [2019-11-20 10:20:34,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2577 transitions. [2019-11-20 10:20:34,546 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 2577 transitions. Word has length 199 [2019-11-20 10:20:34,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:34,547 INFO L462 AbstractCegarLoop]: Abstraction has 1774 states and 2577 transitions. [2019-11-20 10:20:34,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:34,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2577 transitions. [2019-11-20 10:20:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-20 10:20:34,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:34,549 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:34,749 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:20:34,750 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:34,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:34,750 INFO L82 PathProgramCache]: Analyzing trace with hash -842722510, now seen corresponding path program 1 times [2019-11-20 10:20:34,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:20:34,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1506154234] [2019-11-20 10:20:34,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:20:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:36,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 10:20:36,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:20:36,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:36,075 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 18 treesize of output 19 [2019-11-20 10:20:36,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:36,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:36,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:36,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 10:20:36,109 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:36,109 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 10:20:36,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:36,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:36,112 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:20:36,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 10:20:36,177 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 288 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 10:20:36,177 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:20:36,218 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 22 treesize of output 20 [2019-11-20 10:20:36,220 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:36,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:36,221 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:36,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:36,222 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:20:36,223 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 10:20:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 10:20:36,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1506154234] [2019-11-20 10:20:36,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:20:36,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 10:20:36,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394794581] [2019-11-20 10:20:36,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:36,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:20:36,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:36,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:20:36,254 INFO L87 Difference]: Start difference. First operand 1774 states and 2577 transitions. Second operand 4 states. [2019-11-20 10:20:38,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:38,877 INFO L93 Difference]: Finished difference Result 4125 states and 5976 transitions. [2019-11-20 10:20:38,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:38,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-11-20 10:20:38,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:38,882 INFO L225 Difference]: With dead ends: 4125 [2019-11-20 10:20:38,882 INFO L226 Difference]: Without dead ends: 2370 [2019-11-20 10:20:38,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:20:38,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2019-11-20 10:20:38,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 1954. [2019-11-20 10:20:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-11-20 10:20:38,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2817 transitions. [2019-11-20 10:20:38,973 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2817 transitions. Word has length 204 [2019-11-20 10:20:38,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:38,974 INFO L462 AbstractCegarLoop]: Abstraction has 1954 states and 2817 transitions. [2019-11-20 10:20:38,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:38,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2817 transitions. [2019-11-20 10:20:38,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-20 10:20:38,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:38,977 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:39,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:20:39,185 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:39,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:39,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1080292437, now seen corresponding path program 1 times [2019-11-20 10:20:39,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:20:39,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1937454967] [2019-11-20 10:20:39,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:20:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:40,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 10:20:40,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:20:40,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:40,469 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 18 treesize of output 19 [2019-11-20 10:20:40,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:40,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:40,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:40,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 10:20:40,497 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:40,498 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 10:20:40,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:40,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:40,500 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:20:40,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 10:20:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 291 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 10:20:40,551 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:20:40,593 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 22 treesize of output 20 [2019-11-20 10:20:40,595 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:40,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:40,596 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:40,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:40,597 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:20:40,597 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 10:20:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 10:20:40,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1937454967] [2019-11-20 10:20:40,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:20:40,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 10:20:40,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594878259] [2019-11-20 10:20:40,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:40,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:20:40,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:40,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:20:40,625 INFO L87 Difference]: Start difference. First operand 1954 states and 2817 transitions. Second operand 4 states. [2019-11-20 10:20:43,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:43,284 INFO L93 Difference]: Finished difference Result 4281 states and 6168 transitions. [2019-11-20 10:20:43,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:43,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2019-11-20 10:20:43,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:43,289 INFO L225 Difference]: With dead ends: 4281 [2019-11-20 10:20:43,290 INFO L226 Difference]: Without dead ends: 2346 [2019-11-20 10:20:43,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:20:43,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2019-11-20 10:20:43,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 1954. [2019-11-20 10:20:43,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-11-20 10:20:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2799 transitions. [2019-11-20 10:20:43,365 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2799 transitions. Word has length 205 [2019-11-20 10:20:43,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:43,365 INFO L462 AbstractCegarLoop]: Abstraction has 1954 states and 2799 transitions. [2019-11-20 10:20:43,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:43,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2799 transitions. [2019-11-20 10:20:43,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-20 10:20:43,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:43,369 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:43,576 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:20:43,577 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:43,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:43,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2034535521, now seen corresponding path program 1 times [2019-11-20 10:20:43,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:20:43,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [792527042] [2019-11-20 10:20:43,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:20:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:45,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 10:20:45,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:20:45,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:45,362 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 18 treesize of output 19 [2019-11-20 10:20:45,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:45,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:45,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:45,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 10:20:45,399 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:45,400 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 10:20:45,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:45,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:45,403 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:20:45,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 10:20:45,459 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 282 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 10:20:45,460 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:20:45,479 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 22 treesize of output 20 [2019-11-20 10:20:45,481 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:45,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:45,481 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:45,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:45,482 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:20:45,482 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 10:20:45,507 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 10:20:45,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [792527042] [2019-11-20 10:20:45,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:20:45,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 10:20:45,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886714865] [2019-11-20 10:20:45,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:45,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:20:45,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:45,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:20:45,509 INFO L87 Difference]: Start difference. First operand 1954 states and 2799 transitions. Second operand 4 states. [2019-11-20 10:20:48,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:48,380 INFO L93 Difference]: Finished difference Result 4485 states and 6408 transitions. [2019-11-20 10:20:48,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:48,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2019-11-20 10:20:48,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:48,386 INFO L225 Difference]: With dead ends: 4485 [2019-11-20 10:20:48,386 INFO L226 Difference]: Without dead ends: 2550 [2019-11-20 10:20:48,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:20:48,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2019-11-20 10:20:48,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2122. [2019-11-20 10:20:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2019-11-20 10:20:48,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 3009 transitions. [2019-11-20 10:20:48,482 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 3009 transitions. Word has length 207 [2019-11-20 10:20:48,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:48,483 INFO L462 AbstractCegarLoop]: Abstraction has 2122 states and 3009 transitions. [2019-11-20 10:20:48,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:48,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3009 transitions. [2019-11-20 10:20:48,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-20 10:20:48,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:48,486 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:48,694 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:20:48,697 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:48,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:48,697 INFO L82 PathProgramCache]: Analyzing trace with hash 2041947110, now seen corresponding path program 1 times [2019-11-20 10:20:48,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:20:48,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [932829011] [2019-11-20 10:20:48,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:20:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:50,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 10:20:50,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:20:50,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:50,382 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 18 treesize of output 19 [2019-11-20 10:20:50,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:50,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:50,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:50,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 10:20:50,409 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:50,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 10:20:50,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:50,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:50,412 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:20:50,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 10:20:50,462 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 285 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 10:20:50,462 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:20:50,522 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 22 treesize of output 20 [2019-11-20 10:20:50,526 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:50,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:50,527 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:50,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:50,528 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:20:50,528 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 10:20:50,563 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 10:20:50,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [932829011] [2019-11-20 10:20:50,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:20:50,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 10:20:50,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084100526] [2019-11-20 10:20:50,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:50,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:20:50,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:50,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:20:50,565 INFO L87 Difference]: Start difference. First operand 2122 states and 3009 transitions. Second operand 4 states. [2019-11-20 10:20:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:53,531 INFO L93 Difference]: Finished difference Result 4617 states and 6552 transitions. [2019-11-20 10:20:53,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:53,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-11-20 10:20:53,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:53,538 INFO L225 Difference]: With dead ends: 4617 [2019-11-20 10:20:53,539 INFO L226 Difference]: Without dead ends: 2514 [2019-11-20 10:20:53,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:20:53,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2019-11-20 10:20:53,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 2122. [2019-11-20 10:20:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2019-11-20 10:20:53,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 2985 transitions. [2019-11-20 10:20:53,641 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 2985 transitions. Word has length 208 [2019-11-20 10:20:53,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:53,642 INFO L462 AbstractCegarLoop]: Abstraction has 2122 states and 2985 transitions. [2019-11-20 10:20:53,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:53,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2985 transitions. [2019-11-20 10:20:53,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-20 10:20:53,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:53,646 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:53,895 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:20:53,895 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:53,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:53,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1047950778, now seen corresponding path program 1 times [2019-11-20 10:20:53,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:20:53,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [729518839] [2019-11-20 10:20:53,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3885fd9f-e4fb-401a-80ec-0c08e64b73ce/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:20:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:55,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-20 10:20:55,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:20:56,781 INFO L237 Elim1Store]: Index analysis took 194 ms [2019-11-20 10:20:56,786 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:56,787 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:20:56,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:59,293 WARN L191 SmtUtils]: Spent 2.51 s on a formula simplification that was a NOOP. DAG size: 74 [2019-11-20 10:20:59,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:59,296 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_288|, |v_#memory_$Pointer$.offset_288|], 2=[|v_#memory_$Pointer$.base_284|, |v_#memory_$Pointer$.offset_284|, |v_#memory_$Pointer$.offset_285|, |v_#memory_$Pointer$.base_285|]} [2019-11-20 10:20:59,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:00,139 INFO L237 Elim1Store]: Index analysis took 717 ms [2019-11-20 10:21:01,271 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:21:01,271 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:03,309 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 71 [2019-11-20 10:21:03,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:03,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:03,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:03,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:03,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:03,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:03,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:03,635 INFO L237 Elim1Store]: Index analysis took 257 ms [2019-11-20 10:21:03,894 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 10:21:03,894 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:04,817 WARN L191 SmtUtils]: Spent 921.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-20 10:21:04,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:04,830 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:21:05,393 WARN L191 SmtUtils]: Spent 563.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-20 10:21:05,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:05,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:21:05,879 WARN L191 SmtUtils]: Spent 473.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-20 10:21:05,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:05,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:05,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:05,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:05,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:05,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:05,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:05,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:05,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:05,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:05,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:05,962 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-11-20 10:21:05,962 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:06,174 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-20 10:21:06,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:06,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-11-20 10:21:06,195 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:06,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:06,271 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:21:06,271 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:170, output treesize:65 [2019-11-20 10:21:06,294 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_289|], 12=[|v_#memory_$Pointer$.base_289|]} [2019-11-20 10:21:06,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,307 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:21:06,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:06,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:06,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 10:21:06,362 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:06,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:06,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:06,382 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-20 10:21:06,386 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_290|], 12=[|v_#memory_$Pointer$.base_290|]} [2019-11-20 10:21:06,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,396 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:21:06,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:06,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:06,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,452 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 10:21:06,453 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:06,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:06,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:06,494 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-20 10:21:06,498 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_291|, |v_#memory_$Pointer$.offset_286|, |v_#memory_$Pointer$.base_286|], 12=[|v_#memory_$Pointer$.base_291|]} [2019-11-20 10:21:06,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,581 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:21:06,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:06,768 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-20 10:21:06,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:06,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:06,792 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:21:06,792 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:06,912 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 10:21:06,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:06,916 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:21:06,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:07,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,011 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2019-11-20 10:21:07,012 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:07,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:07,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:07,035 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:141, output treesize:65 [2019-11-20 10:21:07,042 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_292|], 12=[|v_#memory_$Pointer$.base_292|]} [2019-11-20 10:21:07,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,056 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:21:07,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:07,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:07,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,109 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 10:21:07,110 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:07,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:07,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:07,129 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-20 10:21:07,131 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_293|], 12=[|v_#memory_$Pointer$.base_293|]} [2019-11-20 10:21:07,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,141 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:21:07,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:07,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:07,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,190 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 10:21:07,191 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:07,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:07,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:07,210 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-20 10:21:07,221 INFO L392 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_294|], 20=[|v_#memory_$Pointer$.base_294|]} [2019-11-20 10:21:07,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,229 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 95 [2019-11-20 10:21:07,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:07,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:07,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:07,565 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-11-20 10:21:07,566 INFO L343 Elim1Store]: treesize reduction 64, result has 73.9 percent of original size [2019-11-20 10:21:07,566 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 245 [2019-11-20 10:21:07,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:07,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:07,647 INFO L496 ElimStorePlain]: Start of recursive call 3: 9 dim-0 vars, End of recursive call: 9 dim-0 vars, and 7 xjuncts. [2019-11-20 10:21:08,736 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 193 DAG size of output: 148 [2019-11-20 10:21:08,737 INFO L567 ElimStorePlain]: treesize reduction 788, result has 57.9 percent of original size [2019-11-20 10:21:08,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:08,738 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:163, output treesize:1228 [2019-11-20 10:21:08,942 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-11-20 10:21:08,945 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_287|, |v_#memory_$Pointer$.base_287|], 20=[|v_#memory_$Pointer$.offset_295|], 30=[|v_#memory_$Pointer$.base_295|]} [2019-11-20 10:21:08,956 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:21:09,353 WARN L191 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-20 10:21:09,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:09,364 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:21:09,609 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-20 10:21:09,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:09,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:09,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:09,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:09,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:09,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:09,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:09,662 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 6 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 97 [2019-11-20 10:21:09,663 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:09,833 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 10:21:09,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:09,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:09,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:09,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:09,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:09,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:09,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:09,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:09,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:09,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:09,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:09,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:09,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:09,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:09,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:09,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:16,208 WARN L191 SmtUtils]: Spent 6.35 s on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-11-20 10:21:16,209 INFO L343 Elim1Store]: treesize reduction 57, result has 75.8 percent of original size [2019-11-20 10:21:16,209 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 155 treesize of output 282 [2019-11-20 10:21:16,211 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:16,346 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-11-20 10:21:16,346 INFO L567 ElimStorePlain]: treesize reduction 249, result has 39.3 percent of original size [2019-11-20 10:21:16,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:16,347 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:219, output treesize:143 [2019-11-20 10:21:16,361 INFO L392 ElimStorePlain]: Different costs {20=[|v_#memory_$Pointer$.offset_296|], 30=[|v_#memory_$Pointer$.base_296|]} [2019-11-20 10:21:16,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:16,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:16,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:16,395 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 88 [2019-11-20 10:21:16,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:16,535 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-20 10:21:16,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:16,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:16,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:16,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:16,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:16,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:16,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:16,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:16,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:16,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:16,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:16,846 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-11-20 10:21:16,846 INFO L343 Elim1Store]: treesize reduction 40, result has 75.0 percent of original size [2019-11-20 10:21:16,846 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 8 case distinctions, treesize of input 134 treesize of output 198 [2019-11-20 10:21:16,848 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:16,936 INFO L567 ElimStorePlain]: treesize reduction 156, result has 44.9 percent of original size [2019-11-20 10:21:16,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:16,937 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:181, output treesize:127 [2019-11-20 10:21:16,951 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_323|], 20=[|v_#memory_$Pointer$.offset_297|], 30=[|v_#memory_$Pointer$.base_297|]} [2019-11-20 10:21:16,964 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:21:16,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:17,075 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-20 10:21:17,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:17,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,105 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:17,105 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 204 [2019-11-20 10:21:17,106 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:17,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:17,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,304 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:17,304 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 8 case distinctions, treesize of input 161 treesize of output 250 [2019-11-20 10:21:17,306 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:17,416 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-11-20 10:21:17,416 INFO L567 ElimStorePlain]: treesize reduction 220, result has 38.9 percent of original size [2019-11-20 10:21:17,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:17,417 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:272, output treesize:140 [2019-11-20 10:21:17,475 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_324|], 20=[|v_#memory_$Pointer$.offset_298|], 30=[|v_#memory_$Pointer$.base_298|]} [2019-11-20 10:21:17,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-11-20 10:21:17,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:17,654 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-20 10:21:17,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:17,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,677 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 81 [2019-11-20 10:21:17,678 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:17,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:17,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:17,964 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-11-20 10:21:17,964 INFO L343 Elim1Store]: treesize reduction 40, result has 75.0 percent of original size [2019-11-20 10:21:17,964 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 8 case distinctions, treesize of input 147 treesize of output 205 [2019-11-20 10:21:17,966 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:18,078 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-11-20 10:21:18,078 INFO L567 ElimStorePlain]: treesize reduction 156, result has 48.9 percent of original size [2019-11-20 10:21:18,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:18,079 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:191, output treesize:149 [2019-11-20 10:21:18,165 INFO L392 ElimStorePlain]: Different costs {12=[|v_#memory_int_325|, |v_#memory_$Pointer$.offset_299|], 20=[|v_#memory_$Pointer$.base_299|]} [2019-11-20 10:21:18,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:18,182 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 10:21:18,184 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2019-11-20 10:21:18,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:18,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:18,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:18,280 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 73 [2019-11-20 10:21:18,281 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:21:18,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:18,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:18,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:18,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:18,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:18,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:18,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:18,484 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 10:21:18,485 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:18,485 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 110 treesize of output 108 [2019-11-20 10:21:18,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:18,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:18,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:18,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:18,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:18,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:18,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:18,496 INFO L496 ElimStorePlain]: Start of recursive call 4: 11 dim-0 vars, End of recursive call: 11 dim-0 vars, and 6 xjuncts. [2019-11-20 10:21:19,064 WARN L191 SmtUtils]: Spent 568.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-11-20 10:21:19,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:19,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:19,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:19,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:19,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:19,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2019-11-20 10:21:19,072 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:180, output treesize:311 [2019-11-20 10:21:19,237 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 26 [2019-11-20 10:21:19,261 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 35 treesize of output 15 [2019-11-20 10:21:19,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:19,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:19,275 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:21:19,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:3 [2019-11-20 10:21:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 299 proven. 79 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:21:19,757 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:21:19,862 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:21:19,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:19,911 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:21:19,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:19,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 10:21:19,922 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:44 [2019-11-20 10:21:19,976 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.offset_304|, |v_#memory_$Pointer$.base_304|], 2=[|#memory_int|]} [2019-11-20 10:21:19,979 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:21:20,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:20,044 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:21:20,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:20,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 279 treesize of output 195 [2019-11-20 10:21:20,063 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:20,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:20,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:20,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:20,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:20,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 10:21:20,101 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:201, output treesize:191 [2019-11-20 10:21:20,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:20,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:20,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:20,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:20,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:20,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:20,171 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:21:20,188 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:21:20,212 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:21:20,232 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:21:20,695 WARN L191 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2019-11-20 10:21:20,695 INFO L567 ElimStorePlain]: treesize reduction 336, result has 42.0 percent of original size [2019-11-20 10:21:20,703 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:21:20,710 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:21:20,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:20,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2019-11-20 10:21:20,780 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:529, output treesize:257 [2019-11-20 10:21:20,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:20,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:20,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:20,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:20,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:20,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:21,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:22,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:23,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:24,509 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_287|, |v_#memory_$Pointer$.base_287|], 6=[|v_#memory_$Pointer$.offset_306|, |v_#memory_$Pointer$.base_306|]} [2019-11-20 10:21:24,540 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:21:24,574 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:21:24,595 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:21:24,615 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:21:26,877 WARN L191 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2019-11-20 10:21:26,878 INFO L567 ElimStorePlain]: treesize reduction 42, result has 93.3 percent of original size [2019-11-20 10:21:26,898 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:21:26,919 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:21:26,950 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:21:26,969 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:21:28,074 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 97 [2019-11-20 10:21:28,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:28,099 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:21:28,112 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:21:28,171 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:21:28,213 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:21:29,008 WARN L191 SmtUtils]: Spent 793.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-20 10:21:29,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:29,022 INFO L496 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:21:29,038 INFO L496 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:21:29,051 INFO L496 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:21:29,063 INFO L496 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:21:29,369 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 60 [2019-11-20 10:21:29,369 INFO L567 ElimStorePlain]: treesize reduction 444, result has 43.5 percent of original size [2019-11-20 10:21:29,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 12 dim-0 vars, and 2 xjuncts. [2019-11-20 10:21:29,370 INFO L221 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:689, output treesize:342 [2019-11-20 10:21:29,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:29,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:29,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:29,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:29,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:29,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:29,925 INFO L392 ElimStorePlain]: Different costs {21=[|v_#memory_$Pointer$.offset_308|], 41=[|v_#memory_$Pointer$.base_308|]} [2019-11-20 10:21:29,930 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:21:30,138 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-11-20 10:21:30,138 INFO L567 ElimStorePlain]: treesize reduction 352, result has 55.3 percent of original size [2019-11-20 10:21:30,140 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:21:30,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:30,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 10:21:30,193 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:637, output treesize:654 [2019-11-20 10:21:32,646 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:21:32,647 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:21:32,652 INFO L168 Benchmark]: Toolchain (without parser) took 148584.03 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 448.3 MB). Free memory was 954.9 MB in the beginning and 1.3 GB in the end (delta: -355.7 MB). Peak memory consumption was 92.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:21:32,652 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:21:32,653 INFO L168 Benchmark]: CACSL2BoogieTranslator took 907.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2019-11-20 10:21:32,653 INFO L168 Benchmark]: Boogie Procedure Inliner took 144.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:21:32,653 INFO L168 Benchmark]: Boogie Preprocessor took 173.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:21:32,653 INFO L168 Benchmark]: RCFGBuilder took 3388.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.5 MB). Peak memory consumption was 91.5 MB. Max. memory is 11.5 GB. [2019-11-20 10:21:32,654 INFO L168 Benchmark]: TraceAbstraction took 143963.54 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 282.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -275.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. [2019-11-20 10:21:32,655 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 907.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 144.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 173.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3388.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.5 MB). Peak memory consumption was 91.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 143963.54 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 282.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -275.8 MB). Peak memory consumption was 6.3 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...