./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/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 64bit --witnessprinter.graph.data.programhash b367a6c8e6647153c85d5b620a55cdddc26798aa ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_1e3e307a-585c-474f-a8a7-4ad4cec41303/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/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 64bit --witnessprinter.graph.data.programhash b367a6c8e6647153c85d5b620a55cdddc26798aa ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: NullPointerException: null --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:15:51,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:15:51,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:15:51,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:15:51,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:15:51,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:15:51,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:15:51,519 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:15:51,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:15:51,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:15:51,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:15:51,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:15:51,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:15:51,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:15:51,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:15:51,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:15:51,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:15:51,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:15:51,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:15:51,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:15:51,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:15:51,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:15:51,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:15:51,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:15:51,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:15:51,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:15:51,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:15:51,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:15:51,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:15:51,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:15:51,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:15:51,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:15:51,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:15:51,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:15:51,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:15:51,569 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:15:51,570 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:15:51,570 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:15:51,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:15:51,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:15:51,572 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:15:51,574 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-15 21:15:51,604 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:15:51,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:15:51,606 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:15:51,606 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:15:51,606 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:15:51,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:15:51,607 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:15:51,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:15:51,607 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:15:51,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:15:51,608 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:15:51,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:15:51,608 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:15:51,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:15:51,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:15:51,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:15:51,609 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:15:51,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:15:51,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:15:51,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:15:51,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:15:51,611 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:15:51,611 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:15:51,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:15:51,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:15:51,612 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 21:15:51,612 INFO L138 SettingsManager]: * To the following directory=dump/ 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_1e3e307a-585c-474f-a8a7-4ad4cec41303/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b367a6c8e6647153c85d5b620a55cdddc26798aa [2019-11-15 21:15:51,656 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:15:51,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:15:51,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:15:51,674 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:15:51,674 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:15:51,675 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/bin/uautomizer/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-15 21:15:51,741 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/bin/uautomizer/data/accaa485b/b4b31a6b121343ed921dfb45c1084a1d/FLAG2059d4fc6 [2019-11-15 21:15:52,541 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:15:52,542 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-15 21:15:52,595 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/bin/uautomizer/data/accaa485b/b4b31a6b121343ed921dfb45c1084a1d/FLAG2059d4fc6 [2019-11-15 21:15:52,679 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/bin/uautomizer/data/accaa485b/b4b31a6b121343ed921dfb45c1084a1d [2019-11-15 21:15:52,682 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:15:52,683 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:15:52,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:15:52,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:15:52,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:15:52,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:15:52" (1/1) ... [2019-11-15 21:15:52,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f56ae3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:52, skipping insertion in model container [2019-11-15 21:15:52,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:15:52" (1/1) ... [2019-11-15 21:15:52,705 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:15:52,813 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:15:53,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:15:54,025 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:15:54,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:15:54,364 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:15:54,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:54 WrapperNode [2019-11-15 21:15:54,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:15:54,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:15:54,367 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:15:54,367 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:15:54,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:54" (1/1) ... [2019-11-15 21:15:54,445 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:54" (1/1) ... [2019-11-15 21:15:54,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:15:54,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:15:54,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:15:54,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:15:54,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:54" (1/1) ... [2019-11-15 21:15:54,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:54" (1/1) ... [2019-11-15 21:15:54,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:54" (1/1) ... [2019-11-15 21:15:54,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:54" (1/1) ... [2019-11-15 21:15:54,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:54" (1/1) ... [2019-11-15 21:15:54,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:54" (1/1) ... [2019-11-15 21:15:54,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:54" (1/1) ... [2019-11-15 21:15:54,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:15:54,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:15:54,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:15:54,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:15:54,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/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-15 21:15:54,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:15:54,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:15:54,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:15:54,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:15:54,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:15:54,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:15:54,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:15:54,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 21:15:54,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-15 21:15:54,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:15:54,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:15:56,563 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:15:56,564 INFO L284 CfgBuilder]: Removed 178 assume(true) statements. [2019-11-15 21:15:56,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:15:56 BoogieIcfgContainer [2019-11-15 21:15:56,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:15:56,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:15:56,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:15:56,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:15:56,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:15:52" (1/3) ... [2019-11-15 21:15:56,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153a1746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:15:56, skipping insertion in model container [2019-11-15 21:15:56,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:54" (2/3) ... [2019-11-15 21:15:56,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153a1746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:15:56, skipping insertion in model container [2019-11-15 21:15:56,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:15:56" (3/3) ... [2019-11-15 21:15:56,578 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-15 21:15:56,590 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:15:56,606 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-15 21:15:56,620 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-15 21:15:56,649 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:15:56,649 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:15:56,649 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:15:56,650 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:15:56,650 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:15:56,650 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:15:56,650 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:15:56,650 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:15:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2019-11-15 21:15:56,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:15:56,682 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:56,682 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:56,685 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:56,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:56,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1317470260, now seen corresponding path program 1 times [2019-11-15 21:15:56,701 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:56,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481027145] [2019-11-15 21:15:56,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:56,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:56,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:57,152 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-15 21:15:57,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481027145] [2019-11-15 21:15:57,154 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:57,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:15:57,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049252592] [2019-11-15 21:15:57,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:15:57,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:57,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:15:57,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:15:57,176 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 3 states. [2019-11-15 21:15:57,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:57,328 INFO L93 Difference]: Finished difference Result 439 states and 590 transitions. [2019-11-15 21:15:57,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:15:57,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-15 21:15:57,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:57,351 INFO L225 Difference]: With dead ends: 439 [2019-11-15 21:15:57,351 INFO L226 Difference]: Without dead ends: 273 [2019-11-15 21:15:57,356 INFO L600 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-15 21:15:57,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-15 21:15:57,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2019-11-15 21:15:57,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-11-15 21:15:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 357 transitions. [2019-11-15 21:15:57,430 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 357 transitions. Word has length 15 [2019-11-15 21:15:57,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:57,431 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 357 transitions. [2019-11-15 21:15:57,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:15:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 357 transitions. [2019-11-15 21:15:57,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 21:15:57,433 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:57,434 INFO L380 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] [2019-11-15 21:15:57,434 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:57,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:57,435 INFO L82 PathProgramCache]: Analyzing trace with hash -431951774, now seen corresponding path program 1 times [2019-11-15 21:15:57,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:57,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215116034] [2019-11-15 21:15:57,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:57,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:57,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:57,628 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-15 21:15:57,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215116034] [2019-11-15 21:15:57,629 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:57,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:15:57,629 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757793006] [2019-11-15 21:15:57,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:15:57,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:57,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:15:57,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:15:57,636 INFO L87 Difference]: Start difference. First operand 273 states and 357 transitions. Second operand 5 states. [2019-11-15 21:15:57,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:57,810 INFO L93 Difference]: Finished difference Result 692 states and 902 transitions. [2019-11-15 21:15:57,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:15:57,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-15 21:15:57,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:57,821 INFO L225 Difference]: With dead ends: 692 [2019-11-15 21:15:57,821 INFO L226 Difference]: Without dead ends: 424 [2019-11-15 21:15:57,828 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:15:57,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-11-15 21:15:57,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 276. [2019-11-15 21:15:57,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-15 21:15:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 359 transitions. [2019-11-15 21:15:57,894 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 359 transitions. Word has length 25 [2019-11-15 21:15:57,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:57,895 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 359 transitions. [2019-11-15 21:15:57,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:15:57,896 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 359 transitions. [2019-11-15 21:15:57,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 21:15:57,899 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:57,900 INFO L380 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] [2019-11-15 21:15:57,900 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:57,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:57,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1343115170, now seen corresponding path program 1 times [2019-11-15 21:15:57,902 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:57,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852290384] [2019-11-15 21:15:57,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:57,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:57,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:58,062 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-15 21:15:58,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852290384] [2019-11-15 21:15:58,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:58,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:15:58,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168185872] [2019-11-15 21:15:58,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:15:58,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:58,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:15:58,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:15:58,064 INFO L87 Difference]: Start difference. First operand 276 states and 359 transitions. Second operand 3 states. [2019-11-15 21:15:58,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:58,133 INFO L93 Difference]: Finished difference Result 807 states and 1058 transitions. [2019-11-15 21:15:58,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:15:58,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 21:15:58,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:58,146 INFO L225 Difference]: With dead ends: 807 [2019-11-15 21:15:58,147 INFO L226 Difference]: Without dead ends: 536 [2019-11-15 21:15:58,148 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-15 21:15:58,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-11-15 21:15:58,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2019-11-15 21:15:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-11-15 21:15:58,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 699 transitions. [2019-11-15 21:15:58,197 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 699 transitions. Word has length 25 [2019-11-15 21:15:58,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:58,197 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 699 transitions. [2019-11-15 21:15:58,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:15:58,198 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 699 transitions. [2019-11-15 21:15:58,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 21:15:58,204 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:58,205 INFO L380 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] [2019-11-15 21:15:58,205 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:58,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:58,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1313096205, now seen corresponding path program 1 times [2019-11-15 21:15:58,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:58,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849904714] [2019-11-15 21:15:58,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:58,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:58,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:58,333 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-15 21:15:58,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849904714] [2019-11-15 21:15:58,334 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:58,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:15:58,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334687287] [2019-11-15 21:15:58,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:15:58,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:58,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:15:58,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:15:58,337 INFO L87 Difference]: Start difference. First operand 536 states and 699 transitions. Second operand 3 states. [2019-11-15 21:15:58,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:58,366 INFO L93 Difference]: Finished difference Result 536 states and 699 transitions. [2019-11-15 21:15:58,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:15:58,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 21:15:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:58,372 INFO L225 Difference]: With dead ends: 536 [2019-11-15 21:15:58,435 INFO L226 Difference]: Without dead ends: 534 [2019-11-15 21:15:58,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-15 21:15:58,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-11-15 21:15:58,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2019-11-15 21:15:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-11-15 21:15:58,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 697 transitions. [2019-11-15 21:15:58,475 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 697 transitions. Word has length 26 [2019-11-15 21:15:58,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:58,476 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 697 transitions. [2019-11-15 21:15:58,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:15:58,477 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 697 transitions. [2019-11-15 21:15:58,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 21:15:58,478 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:58,478 INFO L380 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] [2019-11-15 21:15:58,479 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:58,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:58,479 INFO L82 PathProgramCache]: Analyzing trace with hash -2051270196, now seen corresponding path program 1 times [2019-11-15 21:15:58,480 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:58,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505871956] [2019-11-15 21:15:58,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:58,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:58,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:58,566 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-15 21:15:58,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505871956] [2019-11-15 21:15:58,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:58,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:15:58,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640942802] [2019-11-15 21:15:58,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:15:58,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:58,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:15:58,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:15:58,568 INFO L87 Difference]: Start difference. First operand 534 states and 697 transitions. Second operand 3 states. [2019-11-15 21:15:58,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:58,594 INFO L93 Difference]: Finished difference Result 534 states and 697 transitions. [2019-11-15 21:15:58,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:15:58,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 21:15:58,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:58,600 INFO L225 Difference]: With dead ends: 534 [2019-11-15 21:15:58,600 INFO L226 Difference]: Without dead ends: 532 [2019-11-15 21:15:58,601 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-15 21:15:58,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-15 21:15:58,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2019-11-15 21:15:58,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-11-15 21:15:58,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 695 transitions. [2019-11-15 21:15:58,634 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 695 transitions. Word has length 27 [2019-11-15 21:15:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:58,634 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 695 transitions. [2019-11-15 21:15:58,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:15:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 695 transitions. [2019-11-15 21:15:58,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 21:15:58,636 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:58,636 INFO L380 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] [2019-11-15 21:15:58,636 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:58,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:58,637 INFO L82 PathProgramCache]: Analyzing trace with hash 835139869, now seen corresponding path program 1 times [2019-11-15 21:15:58,637 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:58,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994730165] [2019-11-15 21:15:58,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:58,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:58,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:58,726 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-15 21:15:58,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994730165] [2019-11-15 21:15:58,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:58,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:15:58,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957648333] [2019-11-15 21:15:58,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:15:58,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:58,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:15:58,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:15:58,728 INFO L87 Difference]: Start difference. First operand 532 states and 695 transitions. Second operand 3 states. [2019-11-15 21:15:58,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:58,756 INFO L93 Difference]: Finished difference Result 532 states and 695 transitions. [2019-11-15 21:15:58,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:15:58,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-15 21:15:58,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:58,765 INFO L225 Difference]: With dead ends: 532 [2019-11-15 21:15:58,765 INFO L226 Difference]: Without dead ends: 524 [2019-11-15 21:15:58,766 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-15 21:15:58,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-11-15 21:15:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2019-11-15 21:15:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-11-15 21:15:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 685 transitions. [2019-11-15 21:15:58,807 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 685 transitions. Word has length 28 [2019-11-15 21:15:58,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:58,807 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 685 transitions. [2019-11-15 21:15:58,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:15:58,807 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 685 transitions. [2019-11-15 21:15:58,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-15 21:15:58,810 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:58,811 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:58,811 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:58,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:58,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1400383319, now seen corresponding path program 1 times [2019-11-15 21:15:58,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:58,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949147263] [2019-11-15 21:15:58,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:58,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:58,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:58,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:15:58,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949147263] [2019-11-15 21:15:58,916 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:58,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:15:58,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276238896] [2019-11-15 21:15:58,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:15:58,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:58,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:15:58,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:15:58,920 INFO L87 Difference]: Start difference. First operand 524 states and 685 transitions. Second operand 3 states. [2019-11-15 21:15:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:59,005 INFO L93 Difference]: Finished difference Result 1101 states and 1447 transitions. [2019-11-15 21:15:59,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:15:59,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-15 21:15:59,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:59,010 INFO L225 Difference]: With dead ends: 1101 [2019-11-15 21:15:59,011 INFO L226 Difference]: Without dead ends: 582 [2019-11-15 21:15:59,012 INFO L600 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-15 21:15:59,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-11-15 21:15:59,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 574. [2019-11-15 21:15:59,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-11-15 21:15:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 756 transitions. [2019-11-15 21:15:59,050 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 756 transitions. Word has length 77 [2019-11-15 21:15:59,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:59,051 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 756 transitions. [2019-11-15 21:15:59,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:15:59,051 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 756 transitions. [2019-11-15 21:15:59,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 21:15:59,053 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:59,054 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:59,054 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:59,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:59,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1604182072, now seen corresponding path program 1 times [2019-11-15 21:15:59,055 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:59,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728896807] [2019-11-15 21:15:59,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:59,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:59,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:59,245 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:15:59,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728896807] [2019-11-15 21:15:59,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:59,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:15:59,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895181324] [2019-11-15 21:15:59,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:15:59,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:59,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:15:59,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:15:59,251 INFO L87 Difference]: Start difference. First operand 574 states and 756 transitions. Second operand 5 states. [2019-11-15 21:15:59,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:59,389 INFO L93 Difference]: Finished difference Result 1806 states and 2410 transitions. [2019-11-15 21:15:59,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:15:59,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-11-15 21:15:59,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:59,399 INFO L225 Difference]: With dead ends: 1806 [2019-11-15 21:15:59,400 INFO L226 Difference]: Without dead ends: 1237 [2019-11-15 21:15:59,401 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:15:59,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2019-11-15 21:15:59,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 586. [2019-11-15 21:15:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-11-15 21:15:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 768 transitions. [2019-11-15 21:15:59,458 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 768 transitions. Word has length 85 [2019-11-15 21:15:59,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:15:59,459 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 768 transitions. [2019-11-15 21:15:59,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:15:59,459 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 768 transitions. [2019-11-15 21:15:59,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 21:15:59,462 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:59,462 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:59,462 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:59,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:59,463 INFO L82 PathProgramCache]: Analyzing trace with hash -552851057, now seen corresponding path program 1 times [2019-11-15 21:15:59,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:59,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732231040] [2019-11-15 21:15:59,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:59,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:59,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:15:59,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732231040] [2019-11-15 21:15:59,674 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:59,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:15:59,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181356232] [2019-11-15 21:15:59,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:15:59,676 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:59,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:15:59,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:15:59,677 INFO L87 Difference]: Start difference. First operand 586 states and 768 transitions. Second operand 5 states. [2019-11-15 21:15:59,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:59,963 INFO L93 Difference]: Finished difference Result 2009 states and 2631 transitions. [2019-11-15 21:15:59,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:15:59,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-11-15 21:15:59,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:15:59,975 INFO L225 Difference]: With dead ends: 2009 [2019-11-15 21:15:59,975 INFO L226 Difference]: Without dead ends: 1428 [2019-11-15 21:15:59,977 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:15:59,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-11-15 21:16:00,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 614. [2019-11-15 21:16:00,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-11-15 21:16:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 796 transitions. [2019-11-15 21:16:00,041 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 796 transitions. Word has length 87 [2019-11-15 21:16:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:00,045 INFO L462 AbstractCegarLoop]: Abstraction has 614 states and 796 transitions. [2019-11-15 21:16:00,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:16:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 796 transitions. [2019-11-15 21:16:00,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 21:16:00,050 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:00,050 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:00,051 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:00,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:00,051 INFO L82 PathProgramCache]: Analyzing trace with hash 148213521, now seen corresponding path program 1 times [2019-11-15 21:16:00,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:00,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759085391] [2019-11-15 21:16:00,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:00,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:00,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:00,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759085391] [2019-11-15 21:16:00,359 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:00,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:16:00,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419617921] [2019-11-15 21:16:00,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:16:00,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:00,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:16:00,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:16:00,361 INFO L87 Difference]: Start difference. First operand 614 states and 796 transitions. Second operand 8 states. [2019-11-15 21:16:01,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:01,121 INFO L93 Difference]: Finished difference Result 1841 states and 2393 transitions. [2019-11-15 21:16:01,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:16:01,122 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2019-11-15 21:16:01,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:01,130 INFO L225 Difference]: With dead ends: 1841 [2019-11-15 21:16:01,130 INFO L226 Difference]: Without dead ends: 1232 [2019-11-15 21:16:01,132 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:16:01,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-11-15 21:16:01,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 638. [2019-11-15 21:16:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-11-15 21:16:01,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 820 transitions. [2019-11-15 21:16:01,277 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 820 transitions. Word has length 87 [2019-11-15 21:16:01,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:01,277 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 820 transitions. [2019-11-15 21:16:01,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:16:01,277 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 820 transitions. [2019-11-15 21:16:01,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 21:16:01,283 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:01,283 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:01,284 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:01,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:01,284 INFO L82 PathProgramCache]: Analyzing trace with hash 75826963, now seen corresponding path program 1 times [2019-11-15 21:16:01,284 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:01,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766418065] [2019-11-15 21:16:01,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:01,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:01,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:01,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:01,534 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766418065] [2019-11-15 21:16:01,534 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:01,535 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:16:01,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078459313] [2019-11-15 21:16:01,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:16:01,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:01,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:16:01,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:16:01,541 INFO L87 Difference]: Start difference. First operand 638 states and 820 transitions. Second operand 7 states. [2019-11-15 21:16:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:02,120 INFO L93 Difference]: Finished difference Result 2114 states and 2738 transitions. [2019-11-15 21:16:02,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:16:02,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-11-15 21:16:02,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:02,131 INFO L225 Difference]: With dead ends: 2114 [2019-11-15 21:16:02,131 INFO L226 Difference]: Without dead ends: 1481 [2019-11-15 21:16:02,134 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:16:02,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-11-15 21:16:02,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 658. [2019-11-15 21:16:02,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-15 21:16:02,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 844 transitions. [2019-11-15 21:16:02,231 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 844 transitions. Word has length 87 [2019-11-15 21:16:02,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:02,231 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 844 transitions. [2019-11-15 21:16:02,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:16:02,232 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 844 transitions. [2019-11-15 21:16:02,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 21:16:02,234 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:02,234 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:02,234 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:02,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:02,235 INFO L82 PathProgramCache]: Analyzing trace with hash -953532335, now seen corresponding path program 1 times [2019-11-15 21:16:02,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:02,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55384423] [2019-11-15 21:16:02,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:02,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:02,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:02,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:02,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55384423] [2019-11-15 21:16:02,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:02,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:16:02,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788220439] [2019-11-15 21:16:02,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:16:02,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:02,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:16:02,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:16:02,565 INFO L87 Difference]: Start difference. First operand 658 states and 844 transitions. Second operand 6 states. [2019-11-15 21:16:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:02,901 INFO L93 Difference]: Finished difference Result 1522 states and 1960 transitions. [2019-11-15 21:16:02,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:16:02,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-11-15 21:16:02,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:02,910 INFO L225 Difference]: With dead ends: 1522 [2019-11-15 21:16:02,910 INFO L226 Difference]: Without dead ends: 1193 [2019-11-15 21:16:02,914 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:16:02,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-11-15 21:16:03,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 664. [2019-11-15 21:16:03,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-11-15 21:16:03,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 850 transitions. [2019-11-15 21:16:03,017 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 850 transitions. Word has length 87 [2019-11-15 21:16:03,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:03,018 INFO L462 AbstractCegarLoop]: Abstraction has 664 states and 850 transitions. [2019-11-15 21:16:03,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:16:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 850 transitions. [2019-11-15 21:16:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-15 21:16:03,020 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:03,021 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:03,021 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:03,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:03,022 INFO L82 PathProgramCache]: Analyzing trace with hash -318769838, now seen corresponding path program 1 times [2019-11-15 21:16:03,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:03,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042809384] [2019-11-15 21:16:03,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:03,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:03,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:03,269 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:03,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042809384] [2019-11-15 21:16:03,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510939026] [2019-11-15 21:16:03,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/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-15 21:16:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:03,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:16:04,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:04,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:04,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:16:04,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-11-15 21:16:04,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967089614] [2019-11-15 21:16:04,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:16:04,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:04,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:16:04,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:16:04,071 INFO L87 Difference]: Start difference. First operand 664 states and 850 transitions. Second operand 4 states. [2019-11-15 21:16:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:04,394 INFO L93 Difference]: Finished difference Result 1983 states and 2540 transitions. [2019-11-15 21:16:04,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:16:04,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-15 21:16:04,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:04,408 INFO L225 Difference]: With dead ends: 1983 [2019-11-15 21:16:04,408 INFO L226 Difference]: Without dead ends: 1978 [2019-11-15 21:16:04,410 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 107 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-15 21:16:04,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2019-11-15 21:16:04,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1932. [2019-11-15 21:16:04,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1932 states. [2019-11-15 21:16:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2484 transitions. [2019-11-15 21:16:04,689 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 2484 transitions. Word has length 107 [2019-11-15 21:16:04,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:04,690 INFO L462 AbstractCegarLoop]: Abstraction has 1932 states and 2484 transitions. [2019-11-15 21:16:04,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:16:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2484 transitions. [2019-11-15 21:16:04,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-15 21:16:04,694 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:04,694 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:04,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:16:04,910 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:04,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:04,910 INFO L82 PathProgramCache]: Analyzing trace with hash 382294740, now seen corresponding path program 1 times [2019-11-15 21:16:04,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:04,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498953655] [2019-11-15 21:16:04,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:04,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:04,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:05,064 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:05,064 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498953655] [2019-11-15 21:16:05,064 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:05,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:16:05,065 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654138830] [2019-11-15 21:16:05,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:16:05,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:05,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:16:05,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:16:05,067 INFO L87 Difference]: Start difference. First operand 1932 states and 2484 transitions. Second operand 4 states. [2019-11-15 21:16:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:05,744 INFO L93 Difference]: Finished difference Result 6351 states and 8217 transitions. [2019-11-15 21:16:05,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:16:05,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-15 21:16:05,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:05,771 INFO L225 Difference]: With dead ends: 6351 [2019-11-15 21:16:05,772 INFO L226 Difference]: Without dead ends: 4424 [2019-11-15 21:16:05,775 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-15 21:16:05,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4424 states. [2019-11-15 21:16:06,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4424 to 1944. [2019-11-15 21:16:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1944 states. [2019-11-15 21:16:06,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1944 states and 2496 transitions. [2019-11-15 21:16:06,085 INFO L78 Accepts]: Start accepts. Automaton has 1944 states and 2496 transitions. Word has length 107 [2019-11-15 21:16:06,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:06,086 INFO L462 AbstractCegarLoop]: Abstraction has 1944 states and 2496 transitions. [2019-11-15 21:16:06,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:16:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 2496 transitions. [2019-11-15 21:16:06,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-15 21:16:06,090 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:06,090 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:06,091 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:06,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:06,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1951549732, now seen corresponding path program 1 times [2019-11-15 21:16:06,092 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:06,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300857489] [2019-11-15 21:16:06,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:06,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:06,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:06,402 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (const Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1305) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1186) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.TermTransferrer.convertApplicationTerm(TermTransferrer.java:182) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:574) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.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.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) 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-15 21:16:06,408 INFO L168 Benchmark]: Toolchain (without parser) took 13724.31 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 474.0 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -303.8 MB). Peak memory consumption was 170.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:06,409 INFO L168 Benchmark]: CDTParser took 0.35 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-15 21:16:06,410 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1681.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -106.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:06,411 INFO L168 Benchmark]: Boogie Procedure Inliner took 177.73 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:06,412 INFO L168 Benchmark]: Boogie Preprocessor took 172.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:06,413 INFO L168 Benchmark]: RCFGBuilder took 1850.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 916.7 MB in the end (delta: 120.8 MB). Peak memory consumption was 120.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:06,413 INFO L168 Benchmark]: TraceAbstraction took 9837.50 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 339.2 MB). Free memory was 916.7 MB in the beginning and 1.2 GB in the end (delta: -331.8 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:06,416 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.35 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 1681.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -106.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 177.73 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 172.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1850.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 916.7 MB in the end (delta: 120.8 MB). Peak memory consumption was 120.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9837.50 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 339.2 MB). Free memory was 916.7 MB in the beginning and 1.2 GB in the end (delta: -331.8 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (const Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (const Int): de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 21:16:09,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:16:09,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:16:09,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:16:09,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:16:09,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:16:09,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:16:09,181 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:16:09,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:16:09,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:16:09,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:16:09,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:16:09,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:16:09,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:16:09,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:16:09,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:16:09,192 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:16:09,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:16:09,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:16:09,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:16:09,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:16:09,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:16:09,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:16:09,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:16:09,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:16:09,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:16:09,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:16:09,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:16:09,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:16:09,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:16:09,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:16:09,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:16:09,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:16:09,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:16:09,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:16:09,215 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:16:09,216 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:16:09,216 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:16:09,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:16:09,217 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:16:09,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:16:09,219 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2019-11-15 21:16:09,235 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:16:09,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:16:09,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:16:09,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:16:09,237 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:16:09,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:16:09,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:16:09,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:16:09,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:16:09,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:16:09,239 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 21:16:09,239 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 21:16:09,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:16:09,240 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:16:09,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:16:09,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:16:09,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:16:09,241 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:16:09,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:16:09,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:16:09,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:16:09,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:16:09,242 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:16:09,243 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 21:16:09,243 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 21:16:09,243 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:16:09,243 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 21:16:09,244 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2019-11-15 21:16:09,244 INFO L138 SettingsManager]: * To the following directory=dump/ 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_1e3e307a-585c-474f-a8a7-4ad4cec41303/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b367a6c8e6647153c85d5b620a55cdddc26798aa [2019-11-15 21:16:09,281 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:16:09,297 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:16:09,305 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:16:09,307 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:16:09,307 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:16:09,309 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/bin/uautomizer/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-15 21:16:09,380 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/bin/uautomizer/data/22280c983/da5cba93a0904bb9a834162e2fd4751f/FLAG17e3cf833 [2019-11-15 21:16:10,224 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:16:10,225 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-15 21:16:10,257 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/bin/uautomizer/data/22280c983/da5cba93a0904bb9a834162e2fd4751f/FLAG17e3cf833 [2019-11-15 21:16:10,710 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/bin/uautomizer/data/22280c983/da5cba93a0904bb9a834162e2fd4751f [2019-11-15 21:16:10,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:16:10,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:16:10,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:16:10,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:16:10,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:16:10,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:16:10" (1/1) ... [2019-11-15 21:16:10,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db17d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:10, skipping insertion in model container [2019-11-15 21:16:10,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:16:10" (1/1) ... [2019-11-15 21:16:10,738 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:16:10,828 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:16:12,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:16:12,132 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:16:12,392 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:16:12,524 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:16:12,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12 WrapperNode [2019-11-15 21:16:12,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:16:12,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:16:12,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:16:12,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:16:12,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (1/1) ... [2019-11-15 21:16:12,611 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (1/1) ... [2019-11-15 21:16:12,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:16:12,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:16:12,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:16:12,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:16:12,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (1/1) ... [2019-11-15 21:16:12,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (1/1) ... [2019-11-15 21:16:12,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (1/1) ... [2019-11-15 21:16:12,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (1/1) ... [2019-11-15 21:16:12,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (1/1) ... [2019-11-15 21:16:12,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (1/1) ... [2019-11-15 21:16:12,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (1/1) ... [2019-11-15 21:16:12,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:16:12,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:16:12,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:16:12,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:16:12,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/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-15 21:16:12,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-15 21:16:12,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-11-15 21:16:12,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 21:16:12,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2019-11-15 21:16:12,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:16:12,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:16:12,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:16:12,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:16:12,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-11-15 21:16:12,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2019-11-15 21:16:12,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:16:12,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 21:16:12,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 21:16:12,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2019-11-15 21:16:12,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-11-15 21:16:12,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-11-15 21:16:12,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2019-11-15 21:16:12,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:16:12,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:16:17,506 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:16:17,506 INFO L284 CfgBuilder]: Removed 178 assume(true) statements. [2019-11-15 21:16:17,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:16:17 BoogieIcfgContainer [2019-11-15 21:16:17,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:16:17,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:16:17,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:16:17,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:16:17,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:16:10" (1/3) ... [2019-11-15 21:16:17,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b05e236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:16:17, skipping insertion in model container [2019-11-15 21:16:17,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:16:12" (2/3) ... [2019-11-15 21:16:17,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b05e236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:16:17, skipping insertion in model container [2019-11-15 21:16:17,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:16:17" (3/3) ... [2019-11-15 21:16:17,520 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-15 21:16:17,532 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:16:17,543 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-15 21:16:17,556 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-15 21:16:17,600 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:16:17,600 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:16:17,600 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:16:17,601 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:16:17,601 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:16:17,601 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:16:17,601 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:16:17,602 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:16:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2019-11-15 21:16:17,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:16:17,642 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:17,643 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:17,646 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:17,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:17,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1317470260, now seen corresponding path program 1 times [2019-11-15 21:16:17,666 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:16:17,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1934223821] [2019-11-15 21:16:17,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/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-15 21:16:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:18,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:16:18,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:18,315 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-15 21:16:18,318 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:16:18,334 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-15 21:16:18,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1934223821] [2019-11-15 21:16:18,336 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:18,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 21:16:18,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381230927] [2019-11-15 21:16:18,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:16:18,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:16:18,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:16:18,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:16:18,363 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 3 states. [2019-11-15 21:16:18,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:18,529 INFO L93 Difference]: Finished difference Result 452 states and 606 transitions. [2019-11-15 21:16:18,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:16:18,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-15 21:16:18,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:18,564 INFO L225 Difference]: With dead ends: 452 [2019-11-15 21:16:18,564 INFO L226 Difference]: Without dead ends: 286 [2019-11-15 21:16:18,570 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-15 21:16:18,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-15 21:16:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2019-11-15 21:16:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-15 21:16:18,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 373 transitions. [2019-11-15 21:16:18,669 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 373 transitions. Word has length 15 [2019-11-15 21:16:18,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:18,670 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 373 transitions. [2019-11-15 21:16:18,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:16:18,670 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 373 transitions. [2019-11-15 21:16:18,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 21:16:18,672 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:18,672 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:18,877 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:16:18,878 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:18,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:18,878 INFO L82 PathProgramCache]: Analyzing trace with hash -2108088415, now seen corresponding path program 1 times [2019-11-15 21:16:18,879 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:16:18,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1094601281] [2019-11-15 21:16:18,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/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-15 21:16:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:19,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:16:19,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:19,473 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-15 21:16:19,473 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:16:19,476 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-15 21:16:19,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1094601281] [2019-11-15 21:16:19,477 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:19,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 21:16:19,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720453554] [2019-11-15 21:16:19,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:16:19,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:16:19,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:16:19,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:16:19,480 INFO L87 Difference]: Start difference. First operand 286 states and 373 transitions. Second operand 3 states. [2019-11-15 21:16:19,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:19,519 INFO L93 Difference]: Finished difference Result 286 states and 373 transitions. [2019-11-15 21:16:19,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:16:19,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-15 21:16:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:19,524 INFO L225 Difference]: With dead ends: 286 [2019-11-15 21:16:19,524 INFO L226 Difference]: Without dead ends: 284 [2019-11-15 21:16:19,527 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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-15 21:16:19,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-15 21:16:19,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2019-11-15 21:16:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-15 21:16:19,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 371 transitions. [2019-11-15 21:16:19,592 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 371 transitions. Word has length 16 [2019-11-15 21:16:19,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:19,593 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 371 transitions. [2019-11-15 21:16:19,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:16:19,594 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 371 transitions. [2019-11-15 21:16:19,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 21:16:19,596 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:19,596 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:19,799 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:16:19,800 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:19,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:19,800 INFO L82 PathProgramCache]: Analyzing trace with hash -926224930, now seen corresponding path program 1 times [2019-11-15 21:16:19,801 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:16:19,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1816340881] [2019-11-15 21:16:19,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/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-15 21:16:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:20,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:16:20,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:20,260 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-15 21:16:20,261 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:16:20,263 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-15 21:16:20,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1816340881] [2019-11-15 21:16:20,264 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:20,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 21:16:20,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193613645] [2019-11-15 21:16:20,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:16:20,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:16:20,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:16:20,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:16:20,266 INFO L87 Difference]: Start difference. First operand 284 states and 371 transitions. Second operand 3 states. [2019-11-15 21:16:20,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:20,286 INFO L93 Difference]: Finished difference Result 284 states and 371 transitions. [2019-11-15 21:16:20,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:16:20,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-15 21:16:20,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:20,289 INFO L225 Difference]: With dead ends: 284 [2019-11-15 21:16:20,289 INFO L226 Difference]: Without dead ends: 282 [2019-11-15 21:16:20,290 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 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-15 21:16:20,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-15 21:16:20,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2019-11-15 21:16:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-15 21:16:20,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 369 transitions. [2019-11-15 21:16:20,328 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 369 transitions. Word has length 17 [2019-11-15 21:16:20,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:20,329 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 369 transitions. [2019-11-15 21:16:20,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:16:20,329 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 369 transitions. [2019-11-15 21:16:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 21:16:20,331 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:20,332 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:20,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:16:20,536 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:20,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:20,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1351804747, now seen corresponding path program 1 times [2019-11-15 21:16:20,537 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:16:20,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1927634875] [2019-11-15 21:16:20,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/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-15 21:16:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:20,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:16:20,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:21,003 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-15 21:16:21,003 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:16:21,006 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-15 21:16:21,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1927634875] [2019-11-15 21:16:21,007 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:21,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 21:16:21,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415089313] [2019-11-15 21:16:21,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:16:21,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:16:21,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:16:21,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:16:21,009 INFO L87 Difference]: Start difference. First operand 282 states and 369 transitions. Second operand 3 states. [2019-11-15 21:16:21,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:21,027 INFO L93 Difference]: Finished difference Result 282 states and 369 transitions. [2019-11-15 21:16:21,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:16:21,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-15 21:16:21,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:21,030 INFO L225 Difference]: With dead ends: 282 [2019-11-15 21:16:21,030 INFO L226 Difference]: Without dead ends: 274 [2019-11-15 21:16:21,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-15 21:16:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-11-15 21:16:21,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2019-11-15 21:16:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-11-15 21:16:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 359 transitions. [2019-11-15 21:16:21,052 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 359 transitions. Word has length 18 [2019-11-15 21:16:21,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:21,052 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 359 transitions. [2019-11-15 21:16:21,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:16:21,053 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 359 transitions. [2019-11-15 21:16:21,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 21:16:21,057 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:21,057 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:21,263 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:16:21,263 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:21,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:21,264 INFO L82 PathProgramCache]: Analyzing trace with hash -673970647, now seen corresponding path program 1 times [2019-11-15 21:16:21,265 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:16:21,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [525560473] [2019-11-15 21:16:21,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/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-15 21:16:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:21,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:16:21,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:16:21,899 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:16:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:16:21,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [525560473] [2019-11-15 21:16:21,913 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:21,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 21:16:21,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357977262] [2019-11-15 21:16:21,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:16:21,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:16:21,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:16:21,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:16:21,916 INFO L87 Difference]: Start difference. First operand 274 states and 359 transitions. Second operand 3 states. [2019-11-15 21:16:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:22,019 INFO L93 Difference]: Finished difference Result 575 states and 759 transitions. [2019-11-15 21:16:22,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:16:22,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-15 21:16:22,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:22,031 INFO L225 Difference]: With dead ends: 575 [2019-11-15 21:16:22,031 INFO L226 Difference]: Without dead ends: 306 [2019-11-15 21:16:22,037 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 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-15 21:16:22,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-15 21:16:22,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 300. [2019-11-15 21:16:22,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-15 21:16:22,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 398 transitions. [2019-11-15 21:16:22,062 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 398 transitions. Word has length 67 [2019-11-15 21:16:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:22,063 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 398 transitions. [2019-11-15 21:16:22,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:16:22,064 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 398 transitions. [2019-11-15 21:16:22,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 21:16:22,070 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:22,071 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:22,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:16:22,284 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:22,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:22,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1604182072, now seen corresponding path program 1 times [2019-11-15 21:16:22,285 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:16:22,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2120318314] [2019-11-15 21:16:22,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/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-15 21:16:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:22,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:16:22,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:23,006 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:16:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:23,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2120318314] [2019-11-15 21:16:23,025 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:23,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-15 21:16:23,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412777509] [2019-11-15 21:16:23,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:16:23,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:16:23,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:16:23,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:16:23,028 INFO L87 Difference]: Start difference. First operand 300 states and 398 transitions. Second operand 5 states. [2019-11-15 21:16:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:23,152 INFO L93 Difference]: Finished difference Result 958 states and 1295 transitions. [2019-11-15 21:16:23,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:16:23,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-11-15 21:16:23,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:23,157 INFO L225 Difference]: With dead ends: 958 [2019-11-15 21:16:23,158 INFO L226 Difference]: Without dead ends: 663 [2019-11-15 21:16:23,159 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:16:23,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-11-15 21:16:23,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 306. [2019-11-15 21:16:23,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-11-15 21:16:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 404 transitions. [2019-11-15 21:16:23,191 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 404 transitions. Word has length 85 [2019-11-15 21:16:23,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:23,192 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 404 transitions. [2019-11-15 21:16:23,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:16:23,192 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 404 transitions. [2019-11-15 21:16:23,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 21:16:23,196 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:23,197 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:23,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:16:23,401 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:23,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:23,401 INFO L82 PathProgramCache]: Analyzing trace with hash -552851057, now seen corresponding path program 1 times [2019-11-15 21:16:23,402 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:16:23,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1988628002] [2019-11-15 21:16:23,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/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-15 21:16:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:23,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:16:23,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:23,962 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:23,969 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:16:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:24,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1988628002] [2019-11-15 21:16:24,022 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:24,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-15 21:16:24,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674762603] [2019-11-15 21:16:24,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:16:24,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:16:24,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:16:24,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:16:24,030 INFO L87 Difference]: Start difference. First operand 306 states and 404 transitions. Second operand 8 states. [2019-11-15 21:16:24,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:24,596 INFO L93 Difference]: Finished difference Result 1481 states and 1961 transitions. [2019-11-15 21:16:24,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 21:16:24,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2019-11-15 21:16:24,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:24,605 INFO L225 Difference]: With dead ends: 1481 [2019-11-15 21:16:24,605 INFO L226 Difference]: Without dead ends: 1180 [2019-11-15 21:16:24,606 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:16:24,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2019-11-15 21:16:24,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 310. [2019-11-15 21:16:24,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-11-15 21:16:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 408 transitions. [2019-11-15 21:16:24,644 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 408 transitions. Word has length 87 [2019-11-15 21:16:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:24,644 INFO L462 AbstractCegarLoop]: Abstraction has 310 states and 408 transitions. [2019-11-15 21:16:24,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:16:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 408 transitions. [2019-11-15 21:16:24,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 21:16:24,646 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:24,646 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:24,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:16:24,856 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:24,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:24,856 INFO L82 PathProgramCache]: Analyzing trace with hash 148213521, now seen corresponding path program 1 times [2019-11-15 21:16:24,856 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:16:24,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1978300068] [2019-11-15 21:16:24,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/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-15 21:16:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:25,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 21:16:25,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:25,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:25,368 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:16:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:25,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1978300068] [2019-11-15 21:16:25,638 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:25,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-15 21:16:25,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093498038] [2019-11-15 21:16:25,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 21:16:25,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:16:25,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:16:25,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:16:25,640 INFO L87 Difference]: Start difference. First operand 310 states and 408 transitions. Second operand 12 states. [2019-11-15 21:16:29,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:29,582 INFO L93 Difference]: Finished difference Result 1184 states and 1566 transitions. [2019-11-15 21:16:29,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:16:29,583 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-11-15 21:16:29,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:29,589 INFO L225 Difference]: With dead ends: 1184 [2019-11-15 21:16:29,589 INFO L226 Difference]: Without dead ends: 879 [2019-11-15 21:16:29,590 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-11-15 21:16:29,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-11-15 21:16:29,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 332. [2019-11-15 21:16:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-15 21:16:29,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 432 transitions. [2019-11-15 21:16:29,640 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 432 transitions. Word has length 87 [2019-11-15 21:16:29,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:29,641 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 432 transitions. [2019-11-15 21:16:29,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 21:16:29,641 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 432 transitions. [2019-11-15 21:16:29,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 21:16:29,642 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:29,642 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:29,847 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:16:29,847 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:29,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:29,847 INFO L82 PathProgramCache]: Analyzing trace with hash -881145777, now seen corresponding path program 1 times [2019-11-15 21:16:29,848 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:16:29,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [907137396] [2019-11-15 21:16:29,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/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-15 21:16:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:30,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 21:16:30,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:30,395 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:16:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:30,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [907137396] [2019-11-15 21:16:30,666 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:30,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-15 21:16:30,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818159422] [2019-11-15 21:16:30,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 21:16:30,667 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:16:30,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 21:16:30,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:16:30,667 INFO L87 Difference]: Start difference. First operand 332 states and 432 transitions. Second operand 14 states. [2019-11-15 21:16:36,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:36,048 INFO L93 Difference]: Finished difference Result 993 states and 1301 transitions. [2019-11-15 21:16:36,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:16:36,049 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 87 [2019-11-15 21:16:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:36,053 INFO L225 Difference]: With dead ends: 993 [2019-11-15 21:16:36,053 INFO L226 Difference]: Without dead ends: 666 [2019-11-15 21:16:36,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:16:36,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-11-15 21:16:36,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 332. [2019-11-15 21:16:36,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-15 21:16:36,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 432 transitions. [2019-11-15 21:16:36,107 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 432 transitions. Word has length 87 [2019-11-15 21:16:36,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:36,108 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 432 transitions. [2019-11-15 21:16:36,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 21:16:36,108 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 432 transitions. [2019-11-15 21:16:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 21:16:36,109 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:36,110 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:36,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:16:36,313 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:36,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:36,314 INFO L82 PathProgramCache]: Analyzing trace with hash -953532335, now seen corresponding path program 1 times [2019-11-15 21:16:36,315 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:16:36,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1212865472] [2019-11-15 21:16:36,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/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-15 21:16:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:37,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:16:37,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:37,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:37,270 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:16:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:37,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1212865472] [2019-11-15 21:16:37,344 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:37,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2019-11-15 21:16:37,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881654962] [2019-11-15 21:16:37,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:16:37,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:16:37,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:16:37,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:16:37,345 INFO L87 Difference]: Start difference. First operand 332 states and 432 transitions. Second operand 7 states. [2019-11-15 21:16:37,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:37,678 INFO L93 Difference]: Finished difference Result 773 states and 1010 transitions. [2019-11-15 21:16:37,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:16:37,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-11-15 21:16:37,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:37,683 INFO L225 Difference]: With dead ends: 773 [2019-11-15 21:16:37,684 INFO L226 Difference]: Without dead ends: 607 [2019-11-15 21:16:37,684 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:16:37,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-11-15 21:16:37,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 335. [2019-11-15 21:16:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-11-15 21:16:37,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 435 transitions. [2019-11-15 21:16:37,733 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 435 transitions. Word has length 87 [2019-11-15 21:16:37,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:37,734 INFO L462 AbstractCegarLoop]: Abstraction has 335 states and 435 transitions. [2019-11-15 21:16:37,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:16:37,734 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 435 transitions. [2019-11-15 21:16:37,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-15 21:16:37,735 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:37,735 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:37,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:16:37,942 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:37,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:37,943 INFO L82 PathProgramCache]: Analyzing trace with hash -318769838, now seen corresponding path program 1 times [2019-11-15 21:16:37,944 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:16:37,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2076100765] [2019-11-15 21:16:37,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/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-15 21:16:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:38,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:16:38,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:38,450 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:16:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:38,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2076100765] [2019-11-15 21:16:38,485 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:16:38,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-15 21:16:38,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308238336] [2019-11-15 21:16:38,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:16:38,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:16:38,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:16:38,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:16:38,486 INFO L87 Difference]: Start difference. First operand 335 states and 435 transitions. Second operand 6 states. [2019-11-15 21:16:38,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:38,906 INFO L93 Difference]: Finished difference Result 1980 states and 2579 transitions. [2019-11-15 21:16:38,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:16:38,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2019-11-15 21:16:38,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:38,916 INFO L225 Difference]: With dead ends: 1980 [2019-11-15 21:16:38,916 INFO L226 Difference]: Without dead ends: 1975 [2019-11-15 21:16:38,917 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:16:38,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2019-11-15 21:16:39,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1920. [2019-11-15 21:16:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1920 states. [2019-11-15 21:16:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 2513 transitions. [2019-11-15 21:16:39,142 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 2513 transitions. Word has length 107 [2019-11-15 21:16:39,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:39,142 INFO L462 AbstractCegarLoop]: Abstraction has 1920 states and 2513 transitions. [2019-11-15 21:16:39,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:16:39,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2513 transitions. [2019-11-15 21:16:39,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-15 21:16:39,145 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:39,145 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:39,353 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:16:39,353 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:39,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:39,353 INFO L82 PathProgramCache]: Analyzing trace with hash 382294740, now seen corresponding path program 1 times [2019-11-15 21:16:39,354 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:16:39,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1175633302] [2019-11-15 21:16:39,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/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-15 21:16:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:39,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:16:39,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:39,823 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:16:39,829 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:39,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1175633302] [2019-11-15 21:16:39,829 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:39,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-15 21:16:39,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692977169] [2019-11-15 21:16:39,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:16:39,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:16:39,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:16:39,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:16:39,832 INFO L87 Difference]: Start difference. First operand 1920 states and 2513 transitions. Second operand 4 states. [2019-11-15 21:16:40,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:40,283 INFO L93 Difference]: Finished difference Result 5928 states and 7774 transitions. [2019-11-15 21:16:40,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:16:40,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-15 21:16:40,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:40,303 INFO L225 Difference]: With dead ends: 5928 [2019-11-15 21:16:40,304 INFO L226 Difference]: Without dead ends: 4013 [2019-11-15 21:16:40,307 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 211 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-15 21:16:40,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2019-11-15 21:16:40,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 1908. [2019-11-15 21:16:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1908 states. [2019-11-15 21:16:40,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2489 transitions. [2019-11-15 21:16:40,577 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2489 transitions. Word has length 107 [2019-11-15 21:16:40,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:40,577 INFO L462 AbstractCegarLoop]: Abstraction has 1908 states and 2489 transitions. [2019-11-15 21:16:40,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:16:40,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2489 transitions. [2019-11-15 21:16:40,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-15 21:16:40,580 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:40,580 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:40,784 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:16:40,784 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:40,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:40,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1951549732, now seen corresponding path program 1 times [2019-11-15 21:16:40,785 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:16:40,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [165097265] [2019-11-15 21:16:40,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/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-15 21:16:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:41,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:16:41,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:41,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:41,662 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:16:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:41,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [165097265] [2019-11-15 21:16:41,697 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:41,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:16:41,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972919144] [2019-11-15 21:16:41,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:16:41,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:16:41,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:16:41,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:16:41,701 INFO L87 Difference]: Start difference. First operand 1908 states and 2489 transitions. Second operand 6 states. [2019-11-15 21:16:42,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:42,222 INFO L93 Difference]: Finished difference Result 7048 states and 9275 transitions. [2019-11-15 21:16:42,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:16:42,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2019-11-15 21:16:42,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:42,246 INFO L225 Difference]: With dead ends: 7048 [2019-11-15 21:16:42,246 INFO L226 Difference]: Without dead ends: 5145 [2019-11-15 21:16:42,250 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:16:42,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5145 states. [2019-11-15 21:16:42,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5145 to 2526. [2019-11-15 21:16:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2526 states. [2019-11-15 21:16:42,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 3275 transitions. [2019-11-15 21:16:42,622 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 3275 transitions. Word has length 111 [2019-11-15 21:16:42,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:42,623 INFO L462 AbstractCegarLoop]: Abstraction has 2526 states and 3275 transitions. [2019-11-15 21:16:42,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:16:42,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 3275 transitions. [2019-11-15 21:16:42,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-15 21:16:42,626 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:42,626 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:42,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:16:42,891 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:42,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:42,891 INFO L82 PathProgramCache]: Analyzing trace with hash -28321698, now seen corresponding path program 1 times [2019-11-15 21:16:42,892 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:16:42,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2065278028] [2019-11-15 21:16:42,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/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-15 21:16:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:43,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 21:16:43,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:43,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:43,974 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:16:43,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:44,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:16:44,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2065278028] [2019-11-15 21:16:44,023 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:44,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2019-11-15 21:16:44,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586701481] [2019-11-15 21:16:44,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:16:44,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:16:44,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:16:44,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:16:44,024 INFO L87 Difference]: Start difference. First operand 2526 states and 3275 transitions. Second operand 6 states. [2019-11-15 21:16:44,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:44,735 INFO L93 Difference]: Finished difference Result 7738 states and 10048 transitions. [2019-11-15 21:16:44,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:16:44,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2019-11-15 21:16:44,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:44,753 INFO L225 Difference]: With dead ends: 7738 [2019-11-15 21:16:44,754 INFO L226 Difference]: Without dead ends: 5217 [2019-11-15 21:16:44,758 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 215 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:16:44,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5217 states. [2019-11-15 21:16:45,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5217 to 2526. [2019-11-15 21:16:45,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2526 states. [2019-11-15 21:16:45,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 3263 transitions. [2019-11-15 21:16:45,230 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 3263 transitions. Word has length 111 [2019-11-15 21:16:45,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:45,230 INFO L462 AbstractCegarLoop]: Abstraction has 2526 states and 3263 transitions. [2019-11-15 21:16:45,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:16:45,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 3263 transitions. [2019-11-15 21:16:45,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-15 21:16:45,233 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:45,234 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:45,443 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:16:45,443 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:45,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:45,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1852552287, now seen corresponding path program 1 times [2019-11-15 21:16:45,444 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:16:45,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [384716328] [2019-11-15 21:16:45,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e3e307a-585c-474f-a8a7-4ad4cec41303/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-15 21:17:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:35,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-15 21:17:35,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:17:35,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-15 21:17:35,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:17:35,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:17:35,375 INFO L375 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 7 treesize of output 6 [2019-11-15 21:17:35,376 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:17:35,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:17:35,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:17:35,392 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:12 [2019-11-15 21:17:35,470 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:17:35,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 21:17:35,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:17:35,504 INFO L567 ElimStorePlain]: treesize reduction 14, result has 66.7 percent of original size [2019-11-15 21:17:35,510 INFO L375 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 14 treesize of output 16 [2019-11-15 21:17:35,510 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:17:35,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:17:35,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:17:35,524 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2019-11-15 21:17:35,712 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:17:35,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-15 21:17:35,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:17:35,776 INFO L567 ElimStorePlain]: treesize reduction 28, result has 58.8 percent of original size [2019-11-15 21:17:35,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:17:35,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:40 [2019-11-15 21:17:36,149 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:17:36,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 43 [2019-11-15 21:17:36,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:17:36,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:17:36,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:17:36,179 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:37 [2019-11-15 21:17:40,265 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-15 21:17:44,374 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-15 21:17:50,503 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-15 21:17:58,615 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-15 21:18:04,759 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-15 21:18:08,918 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-15 21:18:08,941 INFO L375 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 32 treesize of output 35 [2019-11-15 21:18:08,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 1 [2019-11-15 21:18:08,951 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:08,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:08,958 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:18:08,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:08,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:18:08,986 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:37 [2019-11-15 21:18:09,008 INFO L375 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 32 treesize of output 35 [2019-11-15 21:18:09,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 1 [2019-11-15 21:18:09,018 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:18:09,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:09,025 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:18:09,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:09,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:18:09,052 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:37 [2019-11-15 21:18:09,056 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_80|], 6=[|v_#memory_int_89|]} [2019-11-15 21:18:09,062 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-15 21:18:09,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:18:09,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:18:09,334 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.downgradeDimensionsIfNecessary(ArrayOccurrenceAnalysis.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:200) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:361) 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.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.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.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.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) 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-15 21:18:09,340 INFO L168 Benchmark]: Toolchain (without parser) took 118621.89 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 770.2 MB). Free memory was 947.0 MB in the beginning and 1.3 GB in the end (delta: -307.9 MB). Peak memory consumption was 462.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:18:09,340 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:18:09,341 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1804.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -136.3 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:18:09,341 INFO L168 Benchmark]: Boogie Procedure Inliner took 191.90 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-15 21:18:09,343 INFO L168 Benchmark]: Boogie Preprocessor took 168.26 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-15 21:18:09,343 INFO L168 Benchmark]: RCFGBuilder took 4621.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 946.5 MB in the end (delta: 123.7 MB). Peak memory consumption was 123.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:18:09,346 INFO L168 Benchmark]: TraceAbstraction took 111828.38 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 601.4 MB). Free memory was 946.5 MB in the beginning and 1.3 GB in the end (delta: -308.4 MB). Peak memory consumption was 293.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:18:09,348 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.42 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1804.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -136.3 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 191.90 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 168.26 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 4621.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 946.5 MB in the end (delta: 123.7 MB). Peak memory consumption was 123.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 111828.38 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 601.4 MB). Free memory was 946.5 MB in the beginning and 1.3 GB in the end (delta: -308.4 MB). Peak memory consumption was 293.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...