./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-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_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/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 3a5763deaf5b650487f1ac07dc70046c731682ee ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/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 3a5763deaf5b650487f1ac07dc70046c731682ee .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-16 00:32:32,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:32:32,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:32:32,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:32:32,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:32:32,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:32:32,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:32:32,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:32:32,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:32:32,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:32:32,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:32:32,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:32:32,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:32:32,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:32:32,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:32:32,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:32:32,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:32:32,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:32:32,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:32:32,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:32:32,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:32:32,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:32:32,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:32:32,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:32:32,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:32:32,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:32:32,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:32:32,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:32:32,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:32:32,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:32:32,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:32:32,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:32:32,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:32:32,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:32:32,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:32:32,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:32:32,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:32:32,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:32:32,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:32:32,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:32:32,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:32:32,245 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-16 00:32:32,270 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:32:32,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:32:32,271 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:32:32,272 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:32:32,272 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:32:32,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:32:32,272 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:32:32,272 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:32:32,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:32:32,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:32:32,273 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:32:32,273 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:32:32,273 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:32:32,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:32:32,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:32:32,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:32:32,274 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:32:32,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:32:32,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:32:32,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:32:32,275 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:32:32,275 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:32:32,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:32:32,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:32:32,276 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:32:32,276 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:32:32,276 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_976e35b4-3c8f-4813-8505-c959368ad082/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 -> 3a5763deaf5b650487f1ac07dc70046c731682ee [2019-11-16 00:32:32,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:32:32,335 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:32:32,340 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:32:32,341 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:32:32,342 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:32:32,342 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-16 00:32:32,404 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/data/e94c8e8e2/6ced9f82eee14fdbb59269a3205eb5a5/FLAGae777a8a5 [2019-11-16 00:32:33,063 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:32:33,065 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-16 00:32:33,127 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/data/e94c8e8e2/6ced9f82eee14fdbb59269a3205eb5a5/FLAGae777a8a5 [2019-11-16 00:32:33,211 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/data/e94c8e8e2/6ced9f82eee14fdbb59269a3205eb5a5 [2019-11-16 00:32:33,214 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:32:33,216 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:32:33,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:32:33,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:32:33,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:32:33,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:32:33" (1/1) ... [2019-11-16 00:32:33,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4defbc2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:33, skipping insertion in model container [2019-11-16 00:32:33,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:32:33" (1/1) ... [2019-11-16 00:32:33,240 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:32:33,328 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:32:34,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:32:34,277 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:32:34,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:32:34,580 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:32:34,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:34 WrapperNode [2019-11-16 00:32:34,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:32:34,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:32:34,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:32:34,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:32:34,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:34" (1/1) ... [2019-11-16 00:32:34,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:34" (1/1) ... [2019-11-16 00:32:34,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:32:34,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:32:34,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:32:34,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:32:34,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:34" (1/1) ... [2019-11-16 00:32:34,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:34" (1/1) ... [2019-11-16 00:32:34,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:34" (1/1) ... [2019-11-16 00:32:34,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:34" (1/1) ... [2019-11-16 00:32:34,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:34" (1/1) ... [2019-11-16 00:32:34,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:34" (1/1) ... [2019-11-16 00:32:34,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:34" (1/1) ... [2019-11-16 00:32:34,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:32:34,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:32:34,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:32:34,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:32:34,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/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-16 00:32:34,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:32:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:32:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:32:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:32:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:32:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:32:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:32:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:32:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-16 00:32:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:32:34,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:32:36,276 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:32:36,276 INFO L284 CfgBuilder]: Removed 174 assume(true) statements. [2019-11-16 00:32:36,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:36 BoogieIcfgContainer [2019-11-16 00:32:36,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:32:36,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:32:36,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:32:36,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:32:36,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:32:33" (1/3) ... [2019-11-16 00:32:36,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b7e008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:32:36, skipping insertion in model container [2019-11-16 00:32:36,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:34" (2/3) ... [2019-11-16 00:32:36,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b7e008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:32:36, skipping insertion in model container [2019-11-16 00:32:36,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:36" (3/3) ... [2019-11-16 00:32:36,284 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-16 00:32:36,293 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:32:36,300 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-16 00:32:36,309 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-16 00:32:36,331 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:32:36,332 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:32:36,332 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:32:36,332 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:32:36,332 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:32:36,332 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:32:36,332 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:32:36,333 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:32:36,352 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2019-11-16 00:32:36,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-16 00:32:36,360 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:36,361 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:36,363 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:36,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:36,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1141602014, now seen corresponding path program 1 times [2019-11-16 00:32:36,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:36,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096249218] [2019-11-16 00:32:36,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:36,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:36,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:36,749 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-16 00:32:36,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096249218] [2019-11-16 00:32:36,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:36,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:32:36,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318157837] [2019-11-16 00:32:36,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:32:36,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:36,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:32:36,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:32:36,774 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 3 states. [2019-11-16 00:32:36,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:36,893 INFO L93 Difference]: Finished difference Result 430 states and 577 transitions. [2019-11-16 00:32:36,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:36,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-16 00:32:36,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:36,916 INFO L225 Difference]: With dead ends: 430 [2019-11-16 00:32:36,917 INFO L226 Difference]: Without dead ends: 266 [2019-11-16 00:32:36,920 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-16 00:32:36,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-16 00:32:36,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-11-16 00:32:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-16 00:32:36,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 346 transitions. [2019-11-16 00:32:36,996 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 346 transitions. Word has length 15 [2019-11-16 00:32:36,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:36,997 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 346 transitions. [2019-11-16 00:32:36,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:32:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 346 transitions. [2019-11-16 00:32:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-16 00:32:36,999 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:36,999 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-16 00:32:36,999 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:37,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:37,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1531329680, now seen corresponding path program 1 times [2019-11-16 00:32:37,000 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:37,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101389310] [2019-11-16 00:32:37,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:37,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:37,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:37,193 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-16 00:32:37,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101389310] [2019-11-16 00:32:37,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:37,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:32:37,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370102266] [2019-11-16 00:32:37,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:32:37,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:37,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:32:37,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:32:37,197 INFO L87 Difference]: Start difference. First operand 266 states and 346 transitions. Second operand 5 states. [2019-11-16 00:32:37,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:37,367 INFO L93 Difference]: Finished difference Result 679 states and 879 transitions. [2019-11-16 00:32:37,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:32:37,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-16 00:32:37,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:37,375 INFO L225 Difference]: With dead ends: 679 [2019-11-16 00:32:37,376 INFO L226 Difference]: Without dead ends: 418 [2019-11-16 00:32:37,382 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-16 00:32:37,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-16 00:32:37,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 269. [2019-11-16 00:32:37,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-11-16 00:32:37,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 348 transitions. [2019-11-16 00:32:37,423 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 348 transitions. Word has length 25 [2019-11-16 00:32:37,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:37,423 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 348 transitions. [2019-11-16 00:32:37,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:32:37,423 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 348 transitions. [2019-11-16 00:32:37,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-16 00:32:37,424 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:37,425 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-16 00:32:37,425 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:37,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:37,425 INFO L82 PathProgramCache]: Analyzing trace with hash -988570672, now seen corresponding path program 1 times [2019-11-16 00:32:37,426 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:37,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288902223] [2019-11-16 00:32:37,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:37,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:37,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:37,613 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-16 00:32:37,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288902223] [2019-11-16 00:32:37,614 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:37,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:32:37,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216957322] [2019-11-16 00:32:37,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:32:37,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:37,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:32:37,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:32:37,616 INFO L87 Difference]: Start difference. First operand 269 states and 348 transitions. Second operand 3 states. [2019-11-16 00:32:37,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:37,676 INFO L93 Difference]: Finished difference Result 795 states and 1033 transitions. [2019-11-16 00:32:37,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:37,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-16 00:32:37,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:37,685 INFO L225 Difference]: With dead ends: 795 [2019-11-16 00:32:37,685 INFO L226 Difference]: Without dead ends: 531 [2019-11-16 00:32:37,686 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-16 00:32:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-16 00:32:37,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 519. [2019-11-16 00:32:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-11-16 00:32:37,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 676 transitions. [2019-11-16 00:32:37,724 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 676 transitions. Word has length 25 [2019-11-16 00:32:37,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:37,725 INFO L462 AbstractCegarLoop]: Abstraction has 519 states and 676 transitions. [2019-11-16 00:32:37,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:32:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 676 transitions. [2019-11-16 00:32:37,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-16 00:32:37,730 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:37,730 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-16 00:32:37,731 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:37,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:37,731 INFO L82 PathProgramCache]: Analyzing trace with hash -580913293, now seen corresponding path program 1 times [2019-11-16 00:32:37,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:37,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461689626] [2019-11-16 00:32:37,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:37,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:37,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:37,856 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-16 00:32:37,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461689626] [2019-11-16 00:32:37,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:37,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:32:37,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275309132] [2019-11-16 00:32:37,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:32:37,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:37,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:32:37,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:32:37,858 INFO L87 Difference]: Start difference. First operand 519 states and 676 transitions. Second operand 3 states. [2019-11-16 00:32:37,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:37,889 INFO L93 Difference]: Finished difference Result 519 states and 676 transitions. [2019-11-16 00:32:37,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:37,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-16 00:32:37,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:37,895 INFO L225 Difference]: With dead ends: 519 [2019-11-16 00:32:37,896 INFO L226 Difference]: Without dead ends: 517 [2019-11-16 00:32:37,896 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-16 00:32:37,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-11-16 00:32:37,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2019-11-16 00:32:37,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-11-16 00:32:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 674 transitions. [2019-11-16 00:32:37,926 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 674 transitions. Word has length 26 [2019-11-16 00:32:37,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:37,927 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 674 transitions. [2019-11-16 00:32:37,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:32:37,927 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 674 transitions. [2019-11-16 00:32:37,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-16 00:32:37,930 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:37,930 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-16 00:32:37,930 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:37,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:37,930 INFO L82 PathProgramCache]: Analyzing trace with hash -828436422, now seen corresponding path program 1 times [2019-11-16 00:32:37,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:37,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742995449] [2019-11-16 00:32:37,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:37,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:37,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,031 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-16 00:32:38,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742995449] [2019-11-16 00:32:38,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:38,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:32:38,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433816948] [2019-11-16 00:32:38,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:32:38,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:38,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:32:38,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:32:38,033 INFO L87 Difference]: Start difference. First operand 517 states and 674 transitions. Second operand 3 states. [2019-11-16 00:32:38,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:38,060 INFO L93 Difference]: Finished difference Result 517 states and 674 transitions. [2019-11-16 00:32:38,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:38,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-16 00:32:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:38,064 INFO L225 Difference]: With dead ends: 517 [2019-11-16 00:32:38,064 INFO L226 Difference]: Without dead ends: 515 [2019-11-16 00:32:38,065 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-16 00:32:38,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-11-16 00:32:38,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2019-11-16 00:32:38,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-11-16 00:32:38,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 672 transitions. [2019-11-16 00:32:38,102 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 672 transitions. Word has length 27 [2019-11-16 00:32:38,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:38,102 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 672 transitions. [2019-11-16 00:32:38,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:32:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 672 transitions. [2019-11-16 00:32:38,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-16 00:32:38,104 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:38,104 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-16 00:32:38,104 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:38,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:38,105 INFO L82 PathProgramCache]: Analyzing trace with hash 88281181, now seen corresponding path program 1 times [2019-11-16 00:32:38,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:38,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938899565] [2019-11-16 00:32:38,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:38,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:38,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,212 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-16 00:32:38,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938899565] [2019-11-16 00:32:38,213 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:38,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:32:38,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054067738] [2019-11-16 00:32:38,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:32:38,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:38,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:32:38,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:32:38,214 INFO L87 Difference]: Start difference. First operand 515 states and 672 transitions. Second operand 3 states. [2019-11-16 00:32:38,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:38,246 INFO L93 Difference]: Finished difference Result 515 states and 672 transitions. [2019-11-16 00:32:38,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:38,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-16 00:32:38,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:38,254 INFO L225 Difference]: With dead ends: 515 [2019-11-16 00:32:38,254 INFO L226 Difference]: Without dead ends: 513 [2019-11-16 00:32:38,254 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-16 00:32:38,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-11-16 00:32:38,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2019-11-16 00:32:38,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-11-16 00:32:38,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 670 transitions. [2019-11-16 00:32:38,291 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 670 transitions. Word has length 28 [2019-11-16 00:32:38,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:38,293 INFO L462 AbstractCegarLoop]: Abstraction has 513 states and 670 transitions. [2019-11-16 00:32:38,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:32:38,296 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 670 transitions. [2019-11-16 00:32:38,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-16 00:32:38,299 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:38,299 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, 1] [2019-11-16 00:32:38,300 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:38,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:38,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1558244188, now seen corresponding path program 1 times [2019-11-16 00:32:38,300 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:38,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295343191] [2019-11-16 00:32:38,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:38,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:38,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,377 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-16 00:32:38,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295343191] [2019-11-16 00:32:38,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:38,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:32:38,377 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622311642] [2019-11-16 00:32:38,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:32:38,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:38,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:32:38,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:32:38,379 INFO L87 Difference]: Start difference. First operand 513 states and 670 transitions. Second operand 3 states. [2019-11-16 00:32:38,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:38,408 INFO L93 Difference]: Finished difference Result 513 states and 670 transitions. [2019-11-16 00:32:38,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:38,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-16 00:32:38,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:38,411 INFO L225 Difference]: With dead ends: 513 [2019-11-16 00:32:38,411 INFO L226 Difference]: Without dead ends: 504 [2019-11-16 00:32:38,412 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-16 00:32:38,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-11-16 00:32:38,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-11-16 00:32:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-11-16 00:32:38,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 659 transitions. [2019-11-16 00:32:38,446 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 659 transitions. Word has length 29 [2019-11-16 00:32:38,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:38,447 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 659 transitions. [2019-11-16 00:32:38,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:32:38,447 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 659 transitions. [2019-11-16 00:32:38,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-16 00:32:38,448 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:38,449 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, 1, 1] [2019-11-16 00:32:38,449 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:38,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:38,450 INFO L82 PathProgramCache]: Analyzing trace with hash 876508503, now seen corresponding path program 1 times [2019-11-16 00:32:38,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:38,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85319862] [2019-11-16 00:32:38,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:38,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:38,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,545 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-16 00:32:38,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85319862] [2019-11-16 00:32:38,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:38,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:32:38,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81837183] [2019-11-16 00:32:38,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:32:38,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:38,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:32:38,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:32:38,547 INFO L87 Difference]: Start difference. First operand 504 states and 659 transitions. Second operand 3 states. [2019-11-16 00:32:38,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:38,622 INFO L93 Difference]: Finished difference Result 1061 states and 1395 transitions. [2019-11-16 00:32:38,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:38,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-11-16 00:32:38,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:38,627 INFO L225 Difference]: With dead ends: 1061 [2019-11-16 00:32:38,627 INFO L226 Difference]: Without dead ends: 562 [2019-11-16 00:32:38,628 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-16 00:32:38,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-11-16 00:32:38,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 554. [2019-11-16 00:32:38,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-11-16 00:32:38,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 730 transitions. [2019-11-16 00:32:38,712 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 730 transitions. Word has length 79 [2019-11-16 00:32:38,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:38,712 INFO L462 AbstractCegarLoop]: Abstraction has 554 states and 730 transitions. [2019-11-16 00:32:38,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:32:38,712 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 730 transitions. [2019-11-16 00:32:38,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:32:38,715 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:38,715 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-16 00:32:38,715 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:38,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:38,716 INFO L82 PathProgramCache]: Analyzing trace with hash -233103562, now seen corresponding path program 1 times [2019-11-16 00:32:38,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:38,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988328336] [2019-11-16 00:32:38,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:38,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:38,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:38,852 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-16 00:32:38,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988328336] [2019-11-16 00:32:38,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:38,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:32:38,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605583140] [2019-11-16 00:32:38,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:32:38,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:38,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:32:38,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:32:38,855 INFO L87 Difference]: Start difference. First operand 554 states and 730 transitions. Second operand 5 states. [2019-11-16 00:32:38,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:38,991 INFO L93 Difference]: Finished difference Result 1742 states and 2318 transitions. [2019-11-16 00:32:38,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:32:38,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-11-16 00:32:38,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:39,004 INFO L225 Difference]: With dead ends: 1742 [2019-11-16 00:32:39,006 INFO L226 Difference]: Without dead ends: 1193 [2019-11-16 00:32:39,008 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-16 00:32:39,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-11-16 00:32:39,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 566. [2019-11-16 00:32:39,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-11-16 00:32:39,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 742 transitions. [2019-11-16 00:32:39,061 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 742 transitions. Word has length 87 [2019-11-16 00:32:39,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:39,063 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 742 transitions. [2019-11-16 00:32:39,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:32:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 742 transitions. [2019-11-16 00:32:39,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:32:39,065 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:39,065 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] [2019-11-16 00:32:39,065 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:39,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:39,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1878604643, now seen corresponding path program 1 times [2019-11-16 00:32:39,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:39,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790569647] [2019-11-16 00:32:39,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:39,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:39,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:39,230 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-16 00:32:39,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790569647] [2019-11-16 00:32:39,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:39,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:32:39,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808353329] [2019-11-16 00:32:39,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:32:39,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:39,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:32:39,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:32:39,232 INFO L87 Difference]: Start difference. First operand 566 states and 742 transitions. Second operand 5 states. [2019-11-16 00:32:39,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:39,469 INFO L93 Difference]: Finished difference Result 1941 states and 2541 transitions. [2019-11-16 00:32:39,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:32:39,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-11-16 00:32:39,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:39,478 INFO L225 Difference]: With dead ends: 1941 [2019-11-16 00:32:39,478 INFO L226 Difference]: Without dead ends: 1380 [2019-11-16 00:32:39,480 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-16 00:32:39,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2019-11-16 00:32:39,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 594. [2019-11-16 00:32:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-11-16 00:32:39,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 770 transitions. [2019-11-16 00:32:39,541 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 770 transitions. Word has length 89 [2019-11-16 00:32:39,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:39,542 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 770 transitions. [2019-11-16 00:32:39,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:32:39,543 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 770 transitions. [2019-11-16 00:32:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:32:39,549 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:39,550 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] [2019-11-16 00:32:39,550 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:39,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:39,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1177540065, now seen corresponding path program 1 times [2019-11-16 00:32:39,550 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:39,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195877653] [2019-11-16 00:32:39,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:39,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:39,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:39,802 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-16 00:32:39,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195877653] [2019-11-16 00:32:39,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:39,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:32:39,803 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993201842] [2019-11-16 00:32:39,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:32:39,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:39,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:32:39,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:32:39,804 INFO L87 Difference]: Start difference. First operand 594 states and 770 transitions. Second operand 8 states. [2019-11-16 00:32:40,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:40,380 INFO L93 Difference]: Finished difference Result 1785 states and 2313 transitions. [2019-11-16 00:32:40,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:32:40,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2019-11-16 00:32:40,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:40,387 INFO L225 Difference]: With dead ends: 1785 [2019-11-16 00:32:40,387 INFO L226 Difference]: Without dead ends: 1196 [2019-11-16 00:32:40,389 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:32:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2019-11-16 00:32:40,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 618. [2019-11-16 00:32:40,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-11-16 00:32:40,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 794 transitions. [2019-11-16 00:32:40,532 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 794 transitions. Word has length 89 [2019-11-16 00:32:40,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:40,533 INFO L462 AbstractCegarLoop]: Abstraction has 618 states and 794 transitions. [2019-11-16 00:32:40,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:32:40,533 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 794 transitions. [2019-11-16 00:32:40,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:32:40,535 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:40,535 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] [2019-11-16 00:32:40,535 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:40,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:40,535 INFO L82 PathProgramCache]: Analyzing trace with hash -2021545567, now seen corresponding path program 1 times [2019-11-16 00:32:40,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:40,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701807888] [2019-11-16 00:32:40,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:40,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:40,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:40,715 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-16 00:32:40,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701807888] [2019-11-16 00:32:40,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:40,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:32:40,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779376334] [2019-11-16 00:32:40,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:32:40,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:40,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:32:40,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:32:40,717 INFO L87 Difference]: Start difference. First operand 618 states and 794 transitions. Second operand 7 states. [2019-11-16 00:32:41,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:41,206 INFO L93 Difference]: Finished difference Result 2050 states and 2646 transitions. [2019-11-16 00:32:41,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:32:41,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-11-16 00:32:41,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:41,214 INFO L225 Difference]: With dead ends: 2050 [2019-11-16 00:32:41,214 INFO L226 Difference]: Without dead ends: 1437 [2019-11-16 00:32:41,216 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-16 00:32:41,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2019-11-16 00:32:41,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 638. [2019-11-16 00:32:41,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-11-16 00:32:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 818 transitions. [2019-11-16 00:32:41,301 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 818 transitions. Word has length 89 [2019-11-16 00:32:41,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:41,302 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 818 transitions. [2019-11-16 00:32:41,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:32:41,302 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 818 transitions. [2019-11-16 00:32:41,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:32:41,304 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:41,304 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] [2019-11-16 00:32:41,304 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:41,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:41,305 INFO L82 PathProgramCache]: Analyzing trace with hash 901614431, now seen corresponding path program 1 times [2019-11-16 00:32:41,305 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:41,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693087140] [2019-11-16 00:32:41,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:41,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:41,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:41,528 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-16 00:32:41,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693087140] [2019-11-16 00:32:41,529 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:41,529 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:32:41,529 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676452215] [2019-11-16 00:32:41,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:32:41,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:41,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:32:41,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:32:41,530 INFO L87 Difference]: Start difference. First operand 638 states and 818 transitions. Second operand 6 states. [2019-11-16 00:32:41,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:41,851 INFO L93 Difference]: Finished difference Result 1479 states and 1897 transitions. [2019-11-16 00:32:41,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:32:41,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-11-16 00:32:41,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:41,856 INFO L225 Difference]: With dead ends: 1479 [2019-11-16 00:32:41,856 INFO L226 Difference]: Without dead ends: 846 [2019-11-16 00:32:41,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:32:41,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-11-16 00:32:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 634. [2019-11-16 00:32:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-11-16 00:32:42,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 812 transitions. [2019-11-16 00:32:42,014 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 812 transitions. Word has length 89 [2019-11-16 00:32:42,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:42,015 INFO L462 AbstractCegarLoop]: Abstraction has 634 states and 812 transitions. [2019-11-16 00:32:42,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:32:42,015 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 812 transitions. [2019-11-16 00:32:42,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-16 00:32:42,017 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:42,017 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] [2019-11-16 00:32:42,017 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:42,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:42,018 INFO L82 PathProgramCache]: Analyzing trace with hash -312244890, now seen corresponding path program 1 times [2019-11-16 00:32:42,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:42,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634812020] [2019-11-16 00:32:42,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:42,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:42,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,189 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-16 00:32:42,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634812020] [2019-11-16 00:32:42,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313698126] [2019-11-16 00:32:42,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/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-16 00:32:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:42,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 1401 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:32:42,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:42,729 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-16 00:32:42,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:32:42,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-11-16 00:32:42,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966552854] [2019-11-16 00:32:42,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:32:42,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:42,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:32:42,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:32:42,731 INFO L87 Difference]: Start difference. First operand 634 states and 812 transitions. Second operand 4 states. [2019-11-16 00:32:43,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:43,010 INFO L93 Difference]: Finished difference Result 1893 states and 2426 transitions. [2019-11-16 00:32:43,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:32:43,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-16 00:32:43,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:43,021 INFO L225 Difference]: With dead ends: 1893 [2019-11-16 00:32:43,021 INFO L226 Difference]: Without dead ends: 1888 [2019-11-16 00:32:43,022 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 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-16 00:32:43,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2019-11-16 00:32:43,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1850. [2019-11-16 00:32:43,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2019-11-16 00:32:43,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2382 transitions. [2019-11-16 00:32:43,262 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2382 transitions. Word has length 105 [2019-11-16 00:32:43,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:43,262 INFO L462 AbstractCegarLoop]: Abstraction has 1850 states and 2382 transitions. [2019-11-16 00:32:43,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:32:43,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2382 transitions. [2019-11-16 00:32:43,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-16 00:32:43,266 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:43,266 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] [2019-11-16 00:32:43,471 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:43,472 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:43,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:43,472 INFO L82 PathProgramCache]: Analyzing trace with hash 388819688, now seen corresponding path program 1 times [2019-11-16 00:32:43,473 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:43,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56353539] [2019-11-16 00:32:43,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:43,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:43,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:43,709 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-16 00:32:43,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56353539] [2019-11-16 00:32:43,709 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:43,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:32:43,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283616982] [2019-11-16 00:32:43,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:32:43,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:43,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:32:43,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:32:43,711 INFO L87 Difference]: Start difference. First operand 1850 states and 2382 transitions. Second operand 4 states. [2019-11-16 00:32:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:44,233 INFO L93 Difference]: Finished difference Result 6089 states and 7887 transitions. [2019-11-16 00:32:44,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:32:44,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-16 00:32:44,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:44,258 INFO L225 Difference]: With dead ends: 6089 [2019-11-16 00:32:44,258 INFO L226 Difference]: Without dead ends: 4244 [2019-11-16 00:32:44,264 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-16 00:32:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4244 states. [2019-11-16 00:32:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4244 to 1862. [2019-11-16 00:32:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1862 states. [2019-11-16 00:32:44,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2394 transitions. [2019-11-16 00:32:44,533 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2394 transitions. Word has length 105 [2019-11-16 00:32:44,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:44,534 INFO L462 AbstractCegarLoop]: Abstraction has 1862 states and 2394 transitions. [2019-11-16 00:32:44,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:32:44,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2394 transitions. [2019-11-16 00:32:44,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-16 00:32:44,538 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:44,538 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] [2019-11-16 00:32:44,538 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:44,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:44,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1143320944, now seen corresponding path program 1 times [2019-11-16 00:32:44,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:44,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547319440] [2019-11-16 00:32:44,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:44,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:44,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:44,854 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-16 00:32:44,864 INFO L168 Benchmark]: Toolchain (without parser) took 11643.46 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 348.7 MB). Free memory was 944.7 MB in the beginning and 902.6 MB in the end (delta: 42.1 MB). Peak memory consumption was 390.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:44,864 INFO L168 Benchmark]: CDTParser took 0.50 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-16 00:32:44,865 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1362.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -177.6 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:44,866 INFO L168 Benchmark]: Boogie Procedure Inliner took 149.37 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:44,867 INFO L168 Benchmark]: Boogie Preprocessor took 128.01 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:44,870 INFO L168 Benchmark]: RCFGBuilder took 1417.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 986.2 MB in the end (delta: 125.4 MB). Peak memory consumption was 125.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:44,871 INFO L168 Benchmark]: TraceAbstraction took 8579.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 153.6 MB). Free memory was 986.2 MB in the beginning and 902.6 MB in the end (delta: 83.5 MB). Peak memory consumption was 237.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:44,880 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.50 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 1362.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -177.6 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 149.37 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 128.01 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1417.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 986.2 MB in the end (delta: 125.4 MB). Peak memory consumption was 125.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8579.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 153.6 MB). Free memory was 986.2 MB in the beginning and 902.6 MB in the end (delta: 83.5 MB). Peak memory consumption was 237.1 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-16 00:32:47,185 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:32:47,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:32:47,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:32:47,199 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:32:47,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:32:47,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:32:47,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:32:47,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:32:47,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:32:47,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:32:47,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:32:47,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:32:47,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:32:47,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:32:47,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:32:47,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:32:47,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:32:47,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:32:47,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:32:47,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:32:47,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:32:47,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:32:47,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:32:47,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:32:47,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:32:47,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:32:47,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:32:47,227 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:32:47,228 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:32:47,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:32:47,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:32:47,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:32:47,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:32:47,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:32:47,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:32:47,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:32:47,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:32:47,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:32:47,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:32:47,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:32:47,235 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2019-11-16 00:32:47,249 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:32:47,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:32:47,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:32:47,251 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:32:47,251 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:32:47,251 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:32:47,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:32:47,252 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:32:47,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:32:47,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:32:47,252 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:32:47,256 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:32:47,257 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:32:47,257 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:32:47,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:32:47,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:32:47,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:32:47,258 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:32:47,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:32:47,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:32:47,259 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:32:47,259 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:32:47,259 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:32:47,259 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:32:47,259 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:32:47,260 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:32:47,260 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:32:47,260 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2019-11-16 00:32:47,260 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_976e35b4-3c8f-4813-8505-c959368ad082/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 -> 3a5763deaf5b650487f1ac07dc70046c731682ee [2019-11-16 00:32:47,300 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:32:47,311 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:32:47,315 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:32:47,316 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:32:47,317 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:32:47,318 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-16 00:32:47,371 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/data/ae8164aa0/d44f59fba2464065bdd34b270ad0cadb/FLAG23bdb1139 [2019-11-16 00:32:48,003 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:32:48,006 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-16 00:32:48,059 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/data/ae8164aa0/d44f59fba2464065bdd34b270ad0cadb/FLAG23bdb1139 [2019-11-16 00:32:48,132 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/data/ae8164aa0/d44f59fba2464065bdd34b270ad0cadb [2019-11-16 00:32:48,135 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:32:48,137 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:32:48,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:32:48,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:32:48,147 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:32:48,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:32:48" (1/1) ... [2019-11-16 00:32:48,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599310c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:48, skipping insertion in model container [2019-11-16 00:32:48,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:32:48" (1/1) ... [2019-11-16 00:32:48,160 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:32:48,263 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:32:49,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:32:49,418 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:32:49,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:32:49,684 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:32:49,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:49 WrapperNode [2019-11-16 00:32:49,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:32:49,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:32:49,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:32:49,686 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:32:49,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:49" (1/1) ... [2019-11-16 00:32:49,738 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:49" (1/1) ... [2019-11-16 00:32:49,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:32:49,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:32:49,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:32:49,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:32:49,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:49" (1/1) ... [2019-11-16 00:32:49,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:49" (1/1) ... [2019-11-16 00:32:49,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:49" (1/1) ... [2019-11-16 00:32:49,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:49" (1/1) ... [2019-11-16 00:32:49,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:49" (1/1) ... [2019-11-16 00:32:49,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:49" (1/1) ... [2019-11-16 00:32:49,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:49" (1/1) ... [2019-11-16 00:32:50,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:32:50,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:32:50,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:32:50,006 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:32:50,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/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-16 00:32:50,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-16 00:32:50,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-11-16 00:32:50,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-16 00:32:50,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2019-11-16 00:32:50,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:32:50,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:32:50,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:32:50,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:32:50,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-11-16 00:32:50,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2019-11-16 00:32:50,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:32:50,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-16 00:32:50,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:32:50,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2019-11-16 00:32:50,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-11-16 00:32:50,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-11-16 00:32:50,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2019-11-16 00:32:50,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:32:50,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:32:54,380 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:32:54,381 INFO L284 CfgBuilder]: Removed 174 assume(true) statements. [2019-11-16 00:32:54,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:54 BoogieIcfgContainer [2019-11-16 00:32:54,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:32:54,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:32:54,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:32:54,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:32:54,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:32:48" (1/3) ... [2019-11-16 00:32:54,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665fc2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:32:54, skipping insertion in model container [2019-11-16 00:32:54,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:49" (2/3) ... [2019-11-16 00:32:54,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665fc2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:32:54, skipping insertion in model container [2019-11-16 00:32:54,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:54" (3/3) ... [2019-11-16 00:32:54,389 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-16 00:32:54,399 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:32:54,407 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-16 00:32:54,418 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-16 00:32:54,443 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:32:54,443 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:32:54,443 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:32:54,443 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:32:54,444 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:32:54,444 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:32:54,444 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:32:54,444 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:32:54,462 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2019-11-16 00:32:54,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-16 00:32:54,468 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:54,469 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:54,471 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:54,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:54,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1141602014, now seen corresponding path program 1 times [2019-11-16 00:32:54,488 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:32:54,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [49981048] [2019-11-16 00:32:54,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/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-16 00:32:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:54,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:32:54,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:55,001 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-16 00:32:55,002 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:32:55,014 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-16 00:32:55,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [49981048] [2019-11-16 00:32:55,015 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:55,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:32:55,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529745372] [2019-11-16 00:32:55,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:32:55,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:32:55,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:32:55,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:32:55,041 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2019-11-16 00:32:55,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:55,316 INFO L93 Difference]: Finished difference Result 550 states and 741 transitions. [2019-11-16 00:32:55,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:32:55,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-16 00:32:55,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:55,335 INFO L225 Difference]: With dead ends: 550 [2019-11-16 00:32:55,335 INFO L226 Difference]: Without dead ends: 382 [2019-11-16 00:32:55,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:32:55,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-16 00:32:55,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2019-11-16 00:32:55,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-16 00:32:55,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 501 transitions. [2019-11-16 00:32:55,412 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 501 transitions. Word has length 15 [2019-11-16 00:32:55,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:55,413 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 501 transitions. [2019-11-16 00:32:55,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:32:55,413 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 501 transitions. [2019-11-16 00:32:55,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-16 00:32:55,415 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:55,415 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-16 00:32:55,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:32:55,619 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:55,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:55,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1531329680, now seen corresponding path program 1 times [2019-11-16 00:32:55,620 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:32:55,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [173221498] [2019-11-16 00:32:55,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/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-16 00:32:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:56,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:32:56,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:56,094 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-16 00:32:56,094 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:32:56,097 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-16 00:32:56,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [173221498] [2019-11-16 00:32:56,098 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:56,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:32:56,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215079144] [2019-11-16 00:32:56,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:32:56,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:32:56,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:32:56,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:32:56,101 INFO L87 Difference]: Start difference. First operand 382 states and 501 transitions. Second operand 3 states. [2019-11-16 00:32:56,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:56,169 INFO L93 Difference]: Finished difference Result 412 states and 529 transitions. [2019-11-16 00:32:56,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:56,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-16 00:32:56,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:56,173 INFO L225 Difference]: With dead ends: 412 [2019-11-16 00:32:56,173 INFO L226 Difference]: Without dead ends: 397 [2019-11-16 00:32:56,174 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-16 00:32:56,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-16 00:32:56,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 382. [2019-11-16 00:32:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-16 00:32:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 500 transitions. [2019-11-16 00:32:56,205 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 500 transitions. Word has length 25 [2019-11-16 00:32:56,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:56,205 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 500 transitions. [2019-11-16 00:32:56,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:32:56,206 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 500 transitions. [2019-11-16 00:32:56,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-16 00:32:56,207 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:56,207 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-16 00:32:56,410 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:32:56,411 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:56,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:56,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1531389262, now seen corresponding path program 1 times [2019-11-16 00:32:56,412 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:32:56,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [656138627] [2019-11-16 00:32:56,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/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-16 00:32:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:56,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:32:56,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:56,850 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-16 00:32:56,850 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:32:56,853 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-16 00:32:56,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [656138627] [2019-11-16 00:32:56,854 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:56,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-16 00:32:56,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815453416] [2019-11-16 00:32:56,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:32:56,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:32:56,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:32:56,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:32:56,856 INFO L87 Difference]: Start difference. First operand 382 states and 500 transitions. Second operand 5 states. [2019-11-16 00:32:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:57,053 INFO L93 Difference]: Finished difference Result 1027 states and 1341 transitions. [2019-11-16 00:32:57,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:32:57,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-16 00:32:57,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:57,058 INFO L225 Difference]: With dead ends: 1027 [2019-11-16 00:32:57,058 INFO L226 Difference]: Without dead ends: 650 [2019-11-16 00:32:57,061 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 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-16 00:32:57,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-11-16 00:32:57,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 385. [2019-11-16 00:32:57,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-11-16 00:32:57,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 503 transitions. [2019-11-16 00:32:57,089 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 503 transitions. Word has length 25 [2019-11-16 00:32:57,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:57,090 INFO L462 AbstractCegarLoop]: Abstraction has 385 states and 503 transitions. [2019-11-16 00:32:57,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:32:57,090 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 503 transitions. [2019-11-16 00:32:57,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-16 00:32:57,091 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:57,092 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-16 00:32:57,303 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:32:57,304 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:57,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:57,304 INFO L82 PathProgramCache]: Analyzing trace with hash -988570672, now seen corresponding path program 1 times [2019-11-16 00:32:57,305 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:32:57,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [817550728] [2019-11-16 00:32:57,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/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-16 00:32:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:57,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:32:57,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:57,721 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-16 00:32:57,722 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:32:57,750 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-16 00:32:57,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [817550728] [2019-11-16 00:32:57,751 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:57,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-16 00:32:57,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027341093] [2019-11-16 00:32:57,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:32:57,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:32:57,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:32:57,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:32:57,753 INFO L87 Difference]: Start difference. First operand 385 states and 503 transitions. Second operand 4 states. [2019-11-16 00:32:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:57,877 INFO L93 Difference]: Finished difference Result 1143 states and 1498 transitions. [2019-11-16 00:32:57,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:32:57,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-16 00:32:57,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:57,884 INFO L225 Difference]: With dead ends: 1143 [2019-11-16 00:32:57,884 INFO L226 Difference]: Without dead ends: 763 [2019-11-16 00:32:57,885 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:32:57,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-11-16 00:32:57,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 751. [2019-11-16 00:32:57,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-11-16 00:32:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 985 transitions. [2019-11-16 00:32:57,940 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 985 transitions. Word has length 25 [2019-11-16 00:32:57,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:57,941 INFO L462 AbstractCegarLoop]: Abstraction has 751 states and 985 transitions. [2019-11-16 00:32:57,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:32:57,941 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 985 transitions. [2019-11-16 00:32:57,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-16 00:32:57,943 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:57,943 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-16 00:32:58,149 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:32:58,149 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:58,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:58,150 INFO L82 PathProgramCache]: Analyzing trace with hash -580913293, now seen corresponding path program 1 times [2019-11-16 00:32:58,151 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:32:58,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2142023785] [2019-11-16 00:32:58,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/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-16 00:32:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:58,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:32:58,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:58,549 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-16 00:32:58,550 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:32:58,567 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-16 00:32:58,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2142023785] [2019-11-16 00:32:58,568 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:58,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-16 00:32:58,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091866112] [2019-11-16 00:32:58,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:32:58,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:32:58,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:32:58,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:32:58,570 INFO L87 Difference]: Start difference. First operand 751 states and 985 transitions. Second operand 4 states. [2019-11-16 00:32:58,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:58,621 INFO L93 Difference]: Finished difference Result 751 states and 985 transitions. [2019-11-16 00:32:58,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:58,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-16 00:32:58,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:58,626 INFO L225 Difference]: With dead ends: 751 [2019-11-16 00:32:58,627 INFO L226 Difference]: Without dead ends: 749 [2019-11-16 00:32:58,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:32:58,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2019-11-16 00:32:58,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2019-11-16 00:32:58,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-11-16 00:32:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 983 transitions. [2019-11-16 00:32:58,685 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 983 transitions. Word has length 26 [2019-11-16 00:32:58,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:58,685 INFO L462 AbstractCegarLoop]: Abstraction has 749 states and 983 transitions. [2019-11-16 00:32:58,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:32:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 983 transitions. [2019-11-16 00:32:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-16 00:32:58,687 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:58,687 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-16 00:32:58,899 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:32:58,899 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:58,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:58,899 INFO L82 PathProgramCache]: Analyzing trace with hash -828436422, now seen corresponding path program 1 times [2019-11-16 00:32:58,900 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:32:58,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [143278362] [2019-11-16 00:32:58,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/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-16 00:32:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:59,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:32:59,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:59,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-16 00:32:59,334 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:32:59,339 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-16 00:32:59,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [143278362] [2019-11-16 00:32:59,339 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:59,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-16 00:32:59,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985317080] [2019-11-16 00:32:59,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:32:59,340 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:32:59,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:32:59,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:32:59,343 INFO L87 Difference]: Start difference. First operand 749 states and 983 transitions. Second operand 3 states. [2019-11-16 00:32:59,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:59,413 INFO L93 Difference]: Finished difference Result 749 states and 983 transitions. [2019-11-16 00:32:59,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:59,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-16 00:32:59,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:59,420 INFO L225 Difference]: With dead ends: 749 [2019-11-16 00:32:59,420 INFO L226 Difference]: Without dead ends: 747 [2019-11-16 00:32:59,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 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-16 00:32:59,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-11-16 00:32:59,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2019-11-16 00:32:59,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-11-16 00:32:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 981 transitions. [2019-11-16 00:32:59,484 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 981 transitions. Word has length 27 [2019-11-16 00:32:59,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:59,486 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 981 transitions. [2019-11-16 00:32:59,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:32:59,486 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 981 transitions. [2019-11-16 00:32:59,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-16 00:32:59,492 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:59,492 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-16 00:32:59,695 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:32:59,695 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:59,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:59,695 INFO L82 PathProgramCache]: Analyzing trace with hash 88281181, now seen corresponding path program 1 times [2019-11-16 00:32:59,696 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:32:59,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [458470748] [2019-11-16 00:32:59,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/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-16 00:32:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:59,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:32:59,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:59,997 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-16 00:32:59,997 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:33:00,001 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-16 00:33:00,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [458470748] [2019-11-16 00:33:00,001 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:33:00,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-16 00:33:00,002 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317420266] [2019-11-16 00:33:00,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:33:00,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:33:00,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:33:00,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:33:00,003 INFO L87 Difference]: Start difference. First operand 747 states and 981 transitions. Second operand 3 states. [2019-11-16 00:33:00,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:00,072 INFO L93 Difference]: Finished difference Result 747 states and 981 transitions. [2019-11-16 00:33:00,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:33:00,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-16 00:33:00,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:33:00,077 INFO L225 Difference]: With dead ends: 747 [2019-11-16 00:33:00,077 INFO L226 Difference]: Without dead ends: 745 [2019-11-16 00:33:00,078 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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-16 00:33:00,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-11-16 00:33:00,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-11-16 00:33:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-11-16 00:33:00,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 979 transitions. [2019-11-16 00:33:00,151 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 979 transitions. Word has length 28 [2019-11-16 00:33:00,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:33:00,152 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 979 transitions. [2019-11-16 00:33:00,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:33:00,152 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 979 transitions. [2019-11-16 00:33:00,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-16 00:33:00,153 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:33:00,153 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, 1] [2019-11-16 00:33:00,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:33:00,364 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:33:00,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:00,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1558244188, now seen corresponding path program 1 times [2019-11-16 00:33:00,365 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:33:00,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1284024231] [2019-11-16 00:33:00,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/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-16 00:33:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:00,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:33:00,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:00,706 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-16 00:33:00,707 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:33:00,710 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-16 00:33:00,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1284024231] [2019-11-16 00:33:00,711 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:33:00,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-16 00:33:00,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19429169] [2019-11-16 00:33:00,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:33:00,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:33:00,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:33:00,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:33:00,712 INFO L87 Difference]: Start difference. First operand 745 states and 979 transitions. Second operand 3 states. [2019-11-16 00:33:00,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:00,790 INFO L93 Difference]: Finished difference Result 745 states and 979 transitions. [2019-11-16 00:33:00,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:33:00,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-16 00:33:00,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:33:00,797 INFO L225 Difference]: With dead ends: 745 [2019-11-16 00:33:00,798 INFO L226 Difference]: Without dead ends: 736 [2019-11-16 00:33:00,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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-16 00:33:00,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-11-16 00:33:00,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2019-11-16 00:33:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-11-16 00:33:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 968 transitions. [2019-11-16 00:33:00,862 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 968 transitions. Word has length 29 [2019-11-16 00:33:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:33:00,862 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 968 transitions. [2019-11-16 00:33:00,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:33:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 968 transitions. [2019-11-16 00:33:00,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-16 00:33:00,865 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:33:00,866 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, 1, 1] [2019-11-16 00:33:01,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:33:01,073 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:33:01,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:01,073 INFO L82 PathProgramCache]: Analyzing trace with hash 876508503, now seen corresponding path program 1 times [2019-11-16 00:33:01,074 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:33:01,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [176354469] [2019-11-16 00:33:01,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/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-16 00:33:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:01,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:33:01,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:01,540 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-16 00:33:01,540 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:33:01,555 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-16 00:33:01,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [176354469] [2019-11-16 00:33:01,558 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:33:01,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:33:01,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477001847] [2019-11-16 00:33:01,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:33:01,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:33:01,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:33:01,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:33:01,560 INFO L87 Difference]: Start difference. First operand 736 states and 968 transitions. Second operand 3 states. [2019-11-16 00:33:01,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:01,693 INFO L93 Difference]: Finished difference Result 1551 states and 2053 transitions. [2019-11-16 00:33:01,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:33:01,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-11-16 00:33:01,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:33:01,701 INFO L225 Difference]: With dead ends: 1551 [2019-11-16 00:33:01,701 INFO L226 Difference]: Without dead ends: 820 [2019-11-16 00:33:01,703 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 155 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-16 00:33:01,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-11-16 00:33:01,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 799. [2019-11-16 00:33:01,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-11-16 00:33:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1058 transitions. [2019-11-16 00:33:01,780 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1058 transitions. Word has length 79 [2019-11-16 00:33:01,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:33:01,781 INFO L462 AbstractCegarLoop]: Abstraction has 799 states and 1058 transitions. [2019-11-16 00:33:01,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:33:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1058 transitions. [2019-11-16 00:33:01,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:33:01,783 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:33:01,784 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-16 00:33:01,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:33:01,998 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:33:01,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:01,999 INFO L82 PathProgramCache]: Analyzing trace with hash -233103562, now seen corresponding path program 1 times [2019-11-16 00:33:01,999 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:33:02,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [132604679] [2019-11-16 00:33:02,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/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-16 00:33:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:02,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:33:02,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:02,573 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-16 00:33:02,574 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:33:02,585 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-16 00:33:02,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [132604679] [2019-11-16 00:33:02,585 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:33:02,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-16 00:33:02,586 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675582412] [2019-11-16 00:33:02,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:33:02,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:33:02,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:33:02,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:33:02,587 INFO L87 Difference]: Start difference. First operand 799 states and 1058 transitions. Second operand 5 states. [2019-11-16 00:33:02,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:02,775 INFO L93 Difference]: Finished difference Result 2463 states and 3302 transitions. [2019-11-16 00:33:02,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:33:02,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-11-16 00:33:02,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:33:02,787 INFO L225 Difference]: With dead ends: 2463 [2019-11-16 00:33:02,787 INFO L226 Difference]: Without dead ends: 1669 [2019-11-16 00:33:02,789 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 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-16 00:33:02,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2019-11-16 00:33:02,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 817. [2019-11-16 00:33:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-11-16 00:33:02,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1076 transitions. [2019-11-16 00:33:02,875 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1076 transitions. Word has length 87 [2019-11-16 00:33:02,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:33:02,875 INFO L462 AbstractCegarLoop]: Abstraction has 817 states and 1076 transitions. [2019-11-16 00:33:02,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:33:02,876 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1076 transitions. [2019-11-16 00:33:02,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:33:02,877 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:33:02,881 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] [2019-11-16 00:33:03,094 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:33:03,094 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:33:03,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:03,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1878604643, now seen corresponding path program 1 times [2019-11-16 00:33:03,096 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:33:03,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [252819538] [2019-11-16 00:33:03,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/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-16 00:33:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:03,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:33:03,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:03,718 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-16 00:33:03,724 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:33:03,799 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-16 00:33:03,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [252819538] [2019-11-16 00:33:03,800 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:33:03,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-16 00:33:03,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054400214] [2019-11-16 00:33:03,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:33:03,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:33:03,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:33:03,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:33:03,803 INFO L87 Difference]: Start difference. First operand 817 states and 1076 transitions. Second operand 8 states. [2019-11-16 00:33:04,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:04,609 INFO L93 Difference]: Finished difference Result 3923 states and 5159 transitions. [2019-11-16 00:33:04,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:33:04,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2019-11-16 00:33:04,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:33:04,630 INFO L225 Difference]: With dead ends: 3923 [2019-11-16 00:33:04,630 INFO L226 Difference]: Without dead ends: 3111 [2019-11-16 00:33:04,640 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:33:04,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2019-11-16 00:33:04,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 829. [2019-11-16 00:33:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-11-16 00:33:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1088 transitions. [2019-11-16 00:33:04,769 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1088 transitions. Word has length 89 [2019-11-16 00:33:04,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:33:04,771 INFO L462 AbstractCegarLoop]: Abstraction has 829 states and 1088 transitions. [2019-11-16 00:33:04,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:33:04,771 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1088 transitions. [2019-11-16 00:33:04,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:33:04,779 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:33:04,779 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] [2019-11-16 00:33:04,984 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:33:04,984 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:33:04,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:04,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1177540065, now seen corresponding path program 1 times [2019-11-16 00:33:04,986 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:33:04,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [902952257] [2019-11-16 00:33:04,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/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-16 00:33:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:05,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-16 00:33:05,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:05,585 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-16 00:33:05,585 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:33:05,872 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-16 00:33:05,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [902952257] [2019-11-16 00:33:05,873 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:33:05,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-16 00:33:05,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200563201] [2019-11-16 00:33:05,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:33:05,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:33:05,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:33:05,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:33:05,875 INFO L87 Difference]: Start difference. First operand 829 states and 1088 transitions. Second operand 12 states. [2019-11-16 00:33:08,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:08,882 INFO L93 Difference]: Finished difference Result 3123 states and 4100 transitions. [2019-11-16 00:33:08,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:33:08,883 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-11-16 00:33:08,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:33:08,896 INFO L225 Difference]: With dead ends: 3123 [2019-11-16 00:33:08,897 INFO L226 Difference]: Without dead ends: 2299 [2019-11-16 00:33:08,899 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:33:08,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2019-11-16 00:33:09,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 895. [2019-11-16 00:33:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-11-16 00:33:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1160 transitions. [2019-11-16 00:33:09,037 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1160 transitions. Word has length 89 [2019-11-16 00:33:09,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:33:09,037 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1160 transitions. [2019-11-16 00:33:09,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:33:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1160 transitions. [2019-11-16 00:33:09,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:33:09,040 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:33:09,040 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] [2019-11-16 00:33:09,242 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:33:09,243 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:33:09,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:09,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1745619933, now seen corresponding path program 1 times [2019-11-16 00:33:09,244 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:33:09,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1026009211] [2019-11-16 00:33:09,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/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-16 00:33:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:09,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-16 00:33:09,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:09,831 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-16 00:33:09,831 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:33:10,081 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-16 00:33:10,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1026009211] [2019-11-16 00:33:10,081 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:33:10,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-16 00:33:10,082 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156321069] [2019-11-16 00:33:10,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:33:10,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:33:10,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:33:10,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:33:10,083 INFO L87 Difference]: Start difference. First operand 895 states and 1160 transitions. Second operand 14 states. [2019-11-16 00:33:13,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:13,143 INFO L93 Difference]: Finished difference Result 2641 states and 3425 transitions. [2019-11-16 00:33:13,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:33:13,144 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2019-11-16 00:33:13,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:33:13,153 INFO L225 Difference]: With dead ends: 2641 [2019-11-16 00:33:13,153 INFO L226 Difference]: Without dead ends: 1751 [2019-11-16 00:33:13,155 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:33:13,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2019-11-16 00:33:13,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 895. [2019-11-16 00:33:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-11-16 00:33:13,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1160 transitions. [2019-11-16 00:33:13,284 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1160 transitions. Word has length 89 [2019-11-16 00:33:13,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:33:13,284 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1160 transitions. [2019-11-16 00:33:13,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:33:13,285 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1160 transitions. [2019-11-16 00:33:13,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:33:13,287 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:33:13,287 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] [2019-11-16 00:33:13,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:33:13,500 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:33:13,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:13,500 INFO L82 PathProgramCache]: Analyzing trace with hash 901614431, now seen corresponding path program 1 times [2019-11-16 00:33:13,501 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:33:13,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1938117936] [2019-11-16 00:33:13,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/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-16 00:33:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:14,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-16 00:33:14,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:14,453 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-16 00:33:14,453 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:33:14,463 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-16 00:33:14,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1938117936] [2019-11-16 00:33:14,464 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:33:14,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-11-16 00:33:14,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707593958] [2019-11-16 00:33:14,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:33:14,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:33:14,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:33:14,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:33:14,466 INFO L87 Difference]: Start difference. First operand 895 states and 1160 transitions. Second operand 6 states. [2019-11-16 00:33:15,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:15,055 INFO L93 Difference]: Finished difference Result 2083 states and 2695 transitions. [2019-11-16 00:33:15,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:33:15,056 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-11-16 00:33:15,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:33:15,063 INFO L225 Difference]: With dead ends: 2083 [2019-11-16 00:33:15,063 INFO L226 Difference]: Without dead ends: 1193 [2019-11-16 00:33:15,065 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:33:15,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-11-16 00:33:15,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 895. [2019-11-16 00:33:15,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-11-16 00:33:15,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1157 transitions. [2019-11-16 00:33:15,184 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1157 transitions. Word has length 89 [2019-11-16 00:33:15,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:33:15,184 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1157 transitions. [2019-11-16 00:33:15,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:33:15,185 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1157 transitions. [2019-11-16 00:33:15,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-16 00:33:15,187 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:33:15,187 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] [2019-11-16 00:33:15,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:33:15,393 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:33:15,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:15,394 INFO L82 PathProgramCache]: Analyzing trace with hash -312244890, now seen corresponding path program 1 times [2019-11-16 00:33:15,394 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:33:15,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1591672512] [2019-11-16 00:33:15,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/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-16 00:33:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:15,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:33:15,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:15,972 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-16 00:33:15,973 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:33:16,015 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-16 00:33:16,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1591672512] [2019-11-16 00:33:16,016 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:33:16,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-16 00:33:16,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621778389] [2019-11-16 00:33:16,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:33:16,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:33:16,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:33:16,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:33:16,017 INFO L87 Difference]: Start difference. First operand 895 states and 1157 transitions. Second operand 6 states. [2019-11-16 00:33:16,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:16,687 INFO L93 Difference]: Finished difference Result 5340 states and 6911 transitions. [2019-11-16 00:33:16,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:33:16,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-11-16 00:33:16,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:33:16,716 INFO L225 Difference]: With dead ends: 5340 [2019-11-16 00:33:16,716 INFO L226 Difference]: Without dead ends: 5335 [2019-11-16 00:33:16,718 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 204 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-16 00:33:16,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5335 states. [2019-11-16 00:33:17,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5335 to 5185. [2019-11-16 00:33:17,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5185 states. [2019-11-16 00:33:17,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5185 states to 5185 states and 6732 transitions. [2019-11-16 00:33:17,396 INFO L78 Accepts]: Start accepts. Automaton has 5185 states and 6732 transitions. Word has length 105 [2019-11-16 00:33:17,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:33:17,397 INFO L462 AbstractCegarLoop]: Abstraction has 5185 states and 6732 transitions. [2019-11-16 00:33:17,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:33:17,397 INFO L276 IsEmpty]: Start isEmpty. Operand 5185 states and 6732 transitions. [2019-11-16 00:33:17,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-16 00:33:17,402 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:33:17,402 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] [2019-11-16 00:33:17,606 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:33:17,606 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:33:17,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:17,607 INFO L82 PathProgramCache]: Analyzing trace with hash 388819688, now seen corresponding path program 1 times [2019-11-16 00:33:17,607 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:33:17,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1268941156] [2019-11-16 00:33:17,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:33:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:18,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:33:18,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:18,089 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-16 00:33:18,089 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:33:18,095 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-16 00:33:18,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1268941156] [2019-11-16 00:33:18,096 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:33:18,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-16 00:33:18,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266849978] [2019-11-16 00:33:18,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:33:18,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:33:18,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:33:18,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:33:18,097 INFO L87 Difference]: Start difference. First operand 5185 states and 6732 transitions. Second operand 4 states. [2019-11-16 00:33:19,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:19,288 INFO L93 Difference]: Finished difference Result 15933 states and 20710 transitions. [2019-11-16 00:33:19,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:33:19,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-16 00:33:19,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:33:19,333 INFO L225 Difference]: With dead ends: 15933 [2019-11-16 00:33:19,333 INFO L226 Difference]: Without dead ends: 10753 [2019-11-16 00:33:19,341 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 207 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-16 00:33:19,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10753 states. [2019-11-16 00:33:19,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10753 to 5149. [2019-11-16 00:33:19,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5149 states. [2019-11-16 00:33:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5149 states to 5149 states and 6660 transitions. [2019-11-16 00:33:19,913 INFO L78 Accepts]: Start accepts. Automaton has 5149 states and 6660 transitions. Word has length 105 [2019-11-16 00:33:19,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:33:19,913 INFO L462 AbstractCegarLoop]: Abstraction has 5149 states and 6660 transitions. [2019-11-16 00:33:19,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:33:19,913 INFO L276 IsEmpty]: Start isEmpty. Operand 5149 states and 6660 transitions. [2019-11-16 00:33:19,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-16 00:33:19,919 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:33:19,919 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] [2019-11-16 00:33:20,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:33:20,123 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:33:20,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:20,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1143320944, now seen corresponding path program 1 times [2019-11-16 00:33:20,124 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:33:20,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [998300355] [2019-11-16 00:33:20,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:33:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:21,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:33:21,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:21,144 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-16 00:33:21,144 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:33:21,175 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-16 00:33:21,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [998300355] [2019-11-16 00:33:21,176 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:33:21,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:33:21,176 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924923106] [2019-11-16 00:33:21,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:33:21,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:33:21,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:33:21,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:33:21,177 INFO L87 Difference]: Start difference. First operand 5149 states and 6660 transitions. Second operand 6 states. [2019-11-16 00:33:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:22,607 INFO L93 Difference]: Finished difference Result 18453 states and 24028 transitions. [2019-11-16 00:33:22,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:33:22,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2019-11-16 00:33:22,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:33:22,631 INFO L225 Difference]: With dead ends: 18453 [2019-11-16 00:33:22,631 INFO L226 Difference]: Without dead ends: 13309 [2019-11-16 00:33:22,639 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 213 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-16 00:33:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13309 states. [2019-11-16 00:33:23,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13309 to 7021. [2019-11-16 00:33:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7021 states. [2019-11-16 00:33:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7021 states to 7021 states and 9054 transitions. [2019-11-16 00:33:23,428 INFO L78 Accepts]: Start accepts. Automaton has 7021 states and 9054 transitions. Word has length 109 [2019-11-16 00:33:23,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:33:23,428 INFO L462 AbstractCegarLoop]: Abstraction has 7021 states and 9054 transitions. [2019-11-16 00:33:23,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:33:23,428 INFO L276 IsEmpty]: Start isEmpty. Operand 7021 states and 9054 transitions. [2019-11-16 00:33:23,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-16 00:33:23,434 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:33:23,434 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] [2019-11-16 00:33:23,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:33:23,641 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:33:23,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:23,642 INFO L82 PathProgramCache]: Analyzing trace with hash -662117390, now seen corresponding path program 1 times [2019-11-16 00:33:23,642 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:33:23,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1218444564] [2019-11-16 00:33:23,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:33:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:24,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:33:24,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:24,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:24,910 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-16 00:33:24,910 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:33:24,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:24,965 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-16 00:33:24,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1218444564] [2019-11-16 00:33:24,966 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:33:24,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2019-11-16 00:33:24,966 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139196976] [2019-11-16 00:33:24,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:33:24,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:33:24,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:33:24,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:33:24,967 INFO L87 Difference]: Start difference. First operand 7021 states and 9054 transitions. Second operand 6 states. [2019-11-16 00:33:26,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:26,998 INFO L93 Difference]: Finished difference Result 21417 states and 27628 transitions. [2019-11-16 00:33:26,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:33:26,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2019-11-16 00:33:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:33:27,018 INFO L225 Difference]: With dead ends: 21417 [2019-11-16 00:33:27,019 INFO L226 Difference]: Without dead ends: 14401 [2019-11-16 00:33:27,027 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 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-16 00:33:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14401 states. [2019-11-16 00:33:27,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14401 to 7021. [2019-11-16 00:33:27,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7021 states. [2019-11-16 00:33:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7021 states to 7021 states and 9018 transitions. [2019-11-16 00:33:27,898 INFO L78 Accepts]: Start accepts. Automaton has 7021 states and 9018 transitions. Word has length 109 [2019-11-16 00:33:27,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:33:27,898 INFO L462 AbstractCegarLoop]: Abstraction has 7021 states and 9018 transitions. [2019-11-16 00:33:27,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:33:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 7021 states and 9018 transitions. [2019-11-16 00:33:27,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-16 00:33:27,903 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:33:27,904 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] [2019-11-16 00:33:28,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:33:28,110 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:33:28,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:28,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1043903499, now seen corresponding path program 1 times [2019-11-16 00:33:28,110 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:33:28,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1121294140] [2019-11-16 00:33:28,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976e35b4-3c8f-4813-8505-c959368ad082/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:34:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:39,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-16 00:34:39,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:34:39,604 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-16 00:34:39,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:39,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:39,626 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-16 00:34:39,626 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:39,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:39,634 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-16 00:34:39,634 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:12 [2019-11-16 00:34:39,732 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:39,733 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-16 00:34:39,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:39,786 INFO L567 ElimStorePlain]: treesize reduction 14, result has 66.7 percent of original size [2019-11-16 00:34:39,793 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-16 00:34:39,793 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:39,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:39,810 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-16 00:34:39,810 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2019-11-16 00:34:40,099 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:40,099 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-16 00:34:40,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:40,188 INFO L567 ElimStorePlain]: treesize reduction 28, result has 58.8 percent of original size [2019-11-16 00:34:40,189 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-16 00:34:40,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:40 [2019-11-16 00:34:40,707 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:40,708 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-16 00:34:40,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:40,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:40,734 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-16 00:34:40,734 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:37 [2019-11-16 00:34:42,805 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-16 00:34:44,904 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-16 00:34:47,017 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-16 00:34:49,114 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-16 00:34:55,295 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-16 00:34:57,405 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-16 00:34:57,425 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-16 00:34:57,434 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-16 00:34:57,434 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:57,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:57,441 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:57,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:57,467 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-16 00:34:57,467 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:37 [2019-11-16 00:34:57,491 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-16 00:34:57,505 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-16 00:34:57,506 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:57,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:57,513 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:57,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:57,548 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-16 00:34:57,549 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:37 [2019-11-16 00:34:57,554 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_87|], 6=[|v_#memory_int_96|]} [2019-11-16 00:34:57,559 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-16 00:34:57,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:57,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:34:57,819 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-16 00:34:57,823 INFO L168 Benchmark]: Toolchain (without parser) took 129686.44 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 945.6 MB in the beginning and 994.8 MB in the end (delta: -49.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-16 00:34:57,823 INFO L168 Benchmark]: CDTParser took 0.30 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-16 00:34:57,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1542.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.5 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -140.5 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:34:57,824 INFO L168 Benchmark]: Boogie Procedure Inliner took 149.97 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-16 00:34:57,824 INFO L168 Benchmark]: Boogie Preprocessor took 169.24 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-16 00:34:57,825 INFO L168 Benchmark]: RCFGBuilder took 4376.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 949.4 MB in the end (delta: 123.7 MB). Peak memory consumption was 123.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:34:57,825 INFO L168 Benchmark]: TraceAbstraction took 123438.49 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 949.4 MB in the beginning and 994.8 MB in the end (delta: -45.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-16 00:34:57,827 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.30 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 1542.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.5 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -140.5 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 149.97 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 169.24 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 4376.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 949.4 MB in the end (delta: 123.7 MB). Peak memory consumption was 123.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 123438.49 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 949.4 MB in the beginning and 994.8 MB in the end (delta: -45.5 MB). Peak memory consumption was 1.2 GB. 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...