java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:22:12,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:22:12,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:22:12,243 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:22:12,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:22:12,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:22:12,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:22:12,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:22:12,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:22:12,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:22:12,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:22:12,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:22:12,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:22:12,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:22:12,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:22:12,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:22:12,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:22:12,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:22:12,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:22:12,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:22:12,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:22:12,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:22:12,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:22:12,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:22:12,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:22:12,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:22:12,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:22:12,268 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:22:12,268 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:22:12,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:22:12,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:22:12,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:22:12,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:22:12,271 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:22:12,272 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:22:12,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:22:12,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:22:12,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:22:12,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:22:12,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:22:12,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:22:12,276 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 13:22:12,301 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:22:12,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:22:12,304 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:22:12,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:22:12,304 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:22:12,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:22:12,304 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:22:12,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:22:12,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:22:12,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:22:12,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:22:12,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:22:12,308 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:22:12,308 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:22:12,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:22:12,308 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:22:12,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:22:12,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:22:12,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:22:12,309 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:22:12,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:22:12,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:22:12,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:22:12,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:22:12,311 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:22:12,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:22:12,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:22:12,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:22:12,312 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:22:12,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:22:12,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:22:12,384 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:22:12,387 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:22:12,388 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:22:12,388 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/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-09-20 13:22:12,458 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a163b982c/a3863399916c4106a1bb649c116ba376/FLAGafa36c26b [2019-09-20 13:22:13,136 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:22:13,137 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/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-09-20 13:22:13,168 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a163b982c/a3863399916c4106a1bb649c116ba376/FLAGafa36c26b [2019-09-20 13:22:13,330 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a163b982c/a3863399916c4106a1bb649c116ba376 [2019-09-20 13:22:13,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:22:13,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:22:13,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:22:13,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:22:13,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:22:13,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:22:13" (1/1) ... [2019-09-20 13:22:13,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ed7b8c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:22:13, skipping insertion in model container [2019-09-20 13:22:13,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:22:13" (1/1) ... [2019-09-20 13:22:13,358 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:22:13,463 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:22:14,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:22:14,549 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:22:14,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:22:14,963 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:22:14,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:22:14 WrapperNode [2019-09-20 13:22:14,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:22:14,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:22:14,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:22:14,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:22:14,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:22:14" (1/1) ... [2019-09-20 13:22:14,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:22:14" (1/1) ... [2019-09-20 13:22:15,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:22:14" (1/1) ... [2019-09-20 13:22:15,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:22:14" (1/1) ... [2019-09-20 13:22:15,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:22:14" (1/1) ... [2019-09-20 13:22:15,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:22:14" (1/1) ... [2019-09-20 13:22:15,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:22:14" (1/1) ... [2019-09-20 13:22:15,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:22:15,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:22:15,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:22:15,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:22:15,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:22:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-20 13:22:15,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:22:15,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:22:15,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-09-20 13:22:15,237 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2019-09-20 13:22:15,237 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2019-09-20 13:22:15,237 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_int_in [2019-09-20 13:22:15,237 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2019-09-20 13:22:15,238 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2019-09-20 13:22:15,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-09-20 13:22:15,238 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_maxpacket [2019-09-20 13:22:15,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-09-20 13:22:15,238 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-09-20 13:22:15,239 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-09-20 13:22:15,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-20 13:22:15,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-09-20 13:22:15,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-09-20 13:22:15,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-09-20 13:22:15,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-09-20 13:22:15,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-09-20 13:22:15,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-09-20 13:22:15,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-09-20 13:22:15,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-20 13:22:15,244 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2019-09-20 13:22:15,245 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2019-09-20 13:22:15,245 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2019-09-20 13:22:15,245 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2019-09-20 13:22:15,245 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2019-09-20 13:22:15,245 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2019-09-20 13:22:15,245 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2019-09-20 13:22:15,246 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_irq [2019-09-20 13:22:15,246 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_open [2019-09-20 13:22:15,246 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_close [2019-09-20 13:22:15,246 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_probe [2019-09-20 13:22:15,246 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2019-09-20 13:22:15,246 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_init [2019-09-20 13:22:15,247 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_exit [2019-09-20 13:22:15,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_driver_1 [2019-09-20 13:22:15,247 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:22:15,247 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-09-20 13:22:15,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_register_driver_2 [2019-09-20 13:22:15,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2019-09-20 13:22:15,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_4 [2019-09-20 13:22:15,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_5 [2019-09-20 13:22:15,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_int_urb_6 [2019-09-20 13:22:15,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2019-09-20 13:22:15,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_8 [2019-09-20 13:22:15,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_10 [2019-09-20 13:22:15,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_deregister_11 [2019-09-20 13:22:15,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-20 13:22:15,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata [2019-09-20 13:22:15,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata [2019-09-20 13:22:15,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_put_intf [2019-09-20 13:22:15,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2019-09-20 13:22:15,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2019-09-20 13:22:15,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_int_urb [2019-09-20 13:22:15,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_bulk_urb [2019-09-20 13:22:15,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2019-09-20 13:22:15,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interface_to_usbdev [2019-09-20 13:22:15,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_dev [2019-09-20 13:22:15,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_dev [2019-09-20 13:22:15,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2019-09-20 13:22:15,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2019-09-20 13:22:15,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_register [2019-09-20 13:22:15,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_deregister [2019-09-20 13:22:15,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-20 13:22:15,252 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-09-20 13:22:15,252 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-09-20 13:22:15,253 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2019-09-20 13:22:15,253 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2019-09-20 13:22:15,253 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2019-09-20 13:22:15,253 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-09-20 13:22:15,253 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2019-09-20 13:22:15,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-20 13:22:15,254 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-20 13:22:15,254 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-09-20 13:22:15,255 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2019-09-20 13:22:15,255 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-09-20 13:22:15,255 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-09-20 13:22:15,255 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-09-20 13:22:15,255 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-09-20 13:22:15,256 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-09-20 13:22:15,256 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-09-20 13:22:15,257 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-20 13:22:15,257 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-20 13:22:15,257 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-09-20 13:22:15,257 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:22:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:22:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-20 13:22:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2019-09-20 13:22:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:22:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2019-09-20 13:22:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_int_in [2019-09-20 13:22:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-09-20 13:22:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-09-20 13:22:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-20 13:22:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-20 13:22:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-09-20 13:22:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2019-09-20 13:22:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-09-20 13:22:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-09-20 13:22:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-09-20 13:22:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_8 [2019-09-20 13:22:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2019-09-20 13:22:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-09-20 13:22:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2019-09-20 13:22:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:22:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:22:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-09-20 13:22:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_register_driver_2 [2019-09-20 13:22:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2019-09-20 13:22:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-09-20 13:22:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_deregister_11 [2019-09-20 13:22:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_int_urb_6 [2019-09-20 13:22:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_5 [2019-09-20 13:22:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_10 [2019-09-20 13:22:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2019-09-20 13:22:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_4 [2019-09-20 13:22:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-09-20 13:22:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-09-20 13:22:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-09-20 13:22:15,265 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-09-20 13:22:15,265 INFO L130 BoogieDeclarations]: Found specification of procedure usb_maxpacket [2019-09-20 13:22:15,265 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2019-09-20 13:22:15,265 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2019-09-20 13:22:15,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_int_urb [2019-09-20 13:22:15,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2019-09-20 13:22:15,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interface_to_usbdev [2019-09-20 13:22:15,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata [2019-09-20 13:22:15,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata [2019-09-20 13:22:15,270 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-20 13:22:15,271 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-20 13:22:15,271 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-09-20 13:22:15,271 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-09-20 13:22:15,271 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-09-20 13:22:15,272 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:22:15,272 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:22:15,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:22:15,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-20 13:22:15,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:22:15,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 13:22:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:22:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-09-20 13:22:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:22:15,277 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-09-20 13:22:15,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-09-20 13:22:15,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-09-20 13:22:15,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-09-20 13:22:15,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-09-20 13:22:15,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-09-20 13:22:15,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-09-20 13:22:15,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_driver_1 [2019-09-20 13:22:15,284 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2019-09-20 13:22:15,284 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2019-09-20 13:22:15,285 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2019-09-20 13:22:15,285 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2019-09-20 13:22:15,285 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2019-09-20 13:22:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2019-09-20 13:22:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2019-09-20 13:22:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2019-09-20 13:22:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2019-09-20 13:22:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2019-09-20 13:22:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-09-20 13:22:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2019-09-20 13:22:15,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:22:15,287 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_irq [2019-09-20 13:22:15,287 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_open [2019-09-20 13:22:15,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:22:15,287 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_close [2019-09-20 13:22:15,287 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_probe [2019-09-20 13:22:15,288 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2019-09-20 13:22:15,288 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_init [2019-09-20 13:22:15,288 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_exit [2019-09-20 13:22:15,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-20 13:22:15,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-20 13:22:15,288 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:22:15,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-20 13:22:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_put_intf [2019-09-20 13:22:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_bulk_urb [2019-09-20 13:22:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-09-20 13:22:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_dev [2019-09-20 13:22:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_dev [2019-09-20 13:22:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2019-09-20 13:22:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2019-09-20 13:22:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_register [2019-09-20 13:22:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_deregister [2019-09-20 13:22:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-20 13:22:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:22:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:22:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:22:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:22:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:22:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:22:15,995 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-09-20 13:22:16,922 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:22:16,923 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-20 13:22:16,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:22:16 BoogieIcfgContainer [2019-09-20 13:22:16,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:22:16,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:22:16,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:22:16,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:22:16,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:22:13" (1/3) ... [2019-09-20 13:22:16,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f675fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:22:16, skipping insertion in model container [2019-09-20 13:22:16,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:22:14" (2/3) ... [2019-09-20 13:22:16,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f675fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:22:16, skipping insertion in model container [2019-09-20 13:22:16,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:22:16" (3/3) ... [2019-09-20 13:22:16,932 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-09-20 13:22:16,941 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:22:16,954 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:22:16,972 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:22:17,002 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:22:17,002 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:22:17,003 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:22:17,003 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:22:17,003 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:22:17,003 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:22:17,003 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:22:17,003 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:22:17,003 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:22:17,033 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states. [2019-09-20 13:22:17,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-20 13:22:17,042 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:22:17,043 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:22:17,045 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:22:17,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:22:17,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1288315444, now seen corresponding path program 1 times [2019-09-20 13:22:17,053 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:22:17,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:22:17,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:17,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:22:17,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:22:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:22:17,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:22:17,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:22:17,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:22:17,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:22:17,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:22:17,513 INFO L87 Difference]: Start difference. First operand 504 states. Second operand 3 states. [2019-09-20 13:22:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:22:17,723 INFO L93 Difference]: Finished difference Result 1040 states and 1242 transitions. [2019-09-20 13:22:17,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:22:17,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-09-20 13:22:17,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:22:17,760 INFO L225 Difference]: With dead ends: 1040 [2019-09-20 13:22:17,760 INFO L226 Difference]: Without dead ends: 658 [2019-09-20 13:22:17,767 INFO L636 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-09-20 13:22:17,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-09-20 13:22:17,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2019-09-20 13:22:17,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-09-20 13:22:17,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 772 transitions. [2019-09-20 13:22:17,906 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 772 transitions. Word has length 43 [2019-09-20 13:22:17,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:22:17,907 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 772 transitions. [2019-09-20 13:22:17,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:22:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 772 transitions. [2019-09-20 13:22:17,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-20 13:22:17,912 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:22:17,913 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:22:17,913 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:22:17,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:22:17,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2143860229, now seen corresponding path program 1 times [2019-09-20 13:22:17,914 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:22:17,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:22:17,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:17,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:22:17,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:22:18,202 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:22:18,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:22:18,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:22:18,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:22:18,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:22:18,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:22:18,208 INFO L87 Difference]: Start difference. First operand 658 states and 772 transitions. Second operand 6 states. [2019-09-20 13:22:18,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:22:18,389 INFO L93 Difference]: Finished difference Result 1314 states and 1546 transitions. [2019-09-20 13:22:18,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:22:18,390 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-20 13:22:18,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:22:18,397 INFO L225 Difference]: With dead ends: 1314 [2019-09-20 13:22:18,398 INFO L226 Difference]: Without dead ends: 676 [2019-09-20 13:22:18,403 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:22:18,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-09-20 13:22:18,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 663. [2019-09-20 13:22:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-09-20 13:22:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 776 transitions. [2019-09-20 13:22:18,469 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 776 transitions. Word has length 70 [2019-09-20 13:22:18,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:22:18,469 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 776 transitions. [2019-09-20 13:22:18,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:22:18,470 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 776 transitions. [2019-09-20 13:22:18,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-20 13:22:18,480 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:22:18,480 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:22:18,481 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:22:18,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:22:18,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1392784187, now seen corresponding path program 1 times [2019-09-20 13:22:18,481 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:22:18,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:22:18,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:18,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:22:18,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:22:18,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:22:18,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:22:18,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:22:18,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:22:18,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:22:18,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:22:18,700 INFO L87 Difference]: Start difference. First operand 663 states and 776 transitions. Second operand 3 states. [2019-09-20 13:22:18,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:22:18,789 INFO L93 Difference]: Finished difference Result 1948 states and 2305 transitions. [2019-09-20 13:22:18,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:22:18,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-20 13:22:18,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:22:18,799 INFO L225 Difference]: With dead ends: 1948 [2019-09-20 13:22:18,800 INFO L226 Difference]: Without dead ends: 1305 [2019-09-20 13:22:18,802 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-09-20 13:22:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2019-09-20 13:22:18,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1295. [2019-09-20 13:22:18,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1295 states. [2019-09-20 13:22:18,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1528 transitions. [2019-09-20 13:22:18,870 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1528 transitions. Word has length 70 [2019-09-20 13:22:18,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:22:18,870 INFO L475 AbstractCegarLoop]: Abstraction has 1295 states and 1528 transitions. [2019-09-20 13:22:18,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:22:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1528 transitions. [2019-09-20 13:22:18,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-20 13:22:18,872 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:22:18,872 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:22:18,872 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:22:18,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:22:18,873 INFO L82 PathProgramCache]: Analyzing trace with hash -226781931, now seen corresponding path program 1 times [2019-09-20 13:22:18,873 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:22:18,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:22:18,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:18,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:22:18,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:22:19,013 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:22:19,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:22:19,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:22:19,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:22:19,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:22:19,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:22:19,015 INFO L87 Difference]: Start difference. First operand 1295 states and 1528 transitions. Second operand 3 states. [2019-09-20 13:22:19,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:22:19,068 INFO L93 Difference]: Finished difference Result 1297 states and 1529 transitions. [2019-09-20 13:22:19,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:22:19,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-20 13:22:19,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:22:19,076 INFO L225 Difference]: With dead ends: 1297 [2019-09-20 13:22:19,076 INFO L226 Difference]: Without dead ends: 1294 [2019-09-20 13:22:19,077 INFO L636 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-09-20 13:22:19,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2019-09-20 13:22:19,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2019-09-20 13:22:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1294 states. [2019-09-20 13:22:19,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1526 transitions. [2019-09-20 13:22:19,204 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1526 transitions. Word has length 71 [2019-09-20 13:22:19,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:22:19,205 INFO L475 AbstractCegarLoop]: Abstraction has 1294 states and 1526 transitions. [2019-09-20 13:22:19,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:22:19,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1526 transitions. [2019-09-20 13:22:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-20 13:22:19,207 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:22:19,207 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:22:19,207 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:22:19,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:22:19,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1559554504, now seen corresponding path program 1 times [2019-09-20 13:22:19,208 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:22:19,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:22:19,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:19,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:22:19,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:22:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:22:19,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:22:19,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:22:19,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:22:19,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:22:19,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:22:19,298 INFO L87 Difference]: Start difference. First operand 1294 states and 1526 transitions. Second operand 3 states. [2019-09-20 13:22:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:22:19,353 INFO L93 Difference]: Finished difference Result 1296 states and 1527 transitions. [2019-09-20 13:22:19,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:22:19,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-20 13:22:19,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:22:19,361 INFO L225 Difference]: With dead ends: 1296 [2019-09-20 13:22:19,363 INFO L226 Difference]: Without dead ends: 1293 [2019-09-20 13:22:19,364 INFO L636 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-09-20 13:22:19,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2019-09-20 13:22:19,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1293. [2019-09-20 13:22:19,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1293 states. [2019-09-20 13:22:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1524 transitions. [2019-09-20 13:22:19,439 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1524 transitions. Word has length 72 [2019-09-20 13:22:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:22:19,441 INFO L475 AbstractCegarLoop]: Abstraction has 1293 states and 1524 transitions. [2019-09-20 13:22:19,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:22:19,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1524 transitions. [2019-09-20 13:22:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-20 13:22:19,445 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:22:19,445 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:22:19,446 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:22:19,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:22:19,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1101414008, now seen corresponding path program 1 times [2019-09-20 13:22:19,446 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:22:19,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:22:19,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:19,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:22:19,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:22:19,564 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:22:19,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:22:19,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:22:19,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:22:19,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:22:19,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:22:19,565 INFO L87 Difference]: Start difference. First operand 1293 states and 1524 transitions. Second operand 3 states. [2019-09-20 13:22:19,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:22:19,616 INFO L93 Difference]: Finished difference Result 1295 states and 1525 transitions. [2019-09-20 13:22:19,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:22:19,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-20 13:22:19,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:22:19,624 INFO L225 Difference]: With dead ends: 1295 [2019-09-20 13:22:19,625 INFO L226 Difference]: Without dead ends: 1292 [2019-09-20 13:22:19,625 INFO L636 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-09-20 13:22:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-09-20 13:22:19,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1292. [2019-09-20 13:22:19,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1292 states. [2019-09-20 13:22:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1522 transitions. [2019-09-20 13:22:19,697 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1522 transitions. Word has length 73 [2019-09-20 13:22:19,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:22:19,698 INFO L475 AbstractCegarLoop]: Abstraction has 1292 states and 1522 transitions. [2019-09-20 13:22:19,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:22:19,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1522 transitions. [2019-09-20 13:22:19,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-20 13:22:19,700 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:22:19,700 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:22:19,700 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:22:19,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:22:19,701 INFO L82 PathProgramCache]: Analyzing trace with hash -216034613, now seen corresponding path program 1 times [2019-09-20 13:22:19,701 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:22:19,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:22:19,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:19,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:22:19,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:22:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:22:19,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:22:19,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:22:19,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:22:19,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:22:19,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:22:19,814 INFO L87 Difference]: Start difference. First operand 1292 states and 1522 transitions. Second operand 3 states. [2019-09-20 13:22:19,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:22:19,858 INFO L93 Difference]: Finished difference Result 1294 states and 1523 transitions. [2019-09-20 13:22:19,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:22:19,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-20 13:22:19,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:22:19,865 INFO L225 Difference]: With dead ends: 1294 [2019-09-20 13:22:19,865 INFO L226 Difference]: Without dead ends: 1272 [2019-09-20 13:22:19,867 INFO L636 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-09-20 13:22:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2019-09-20 13:22:19,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1272. [2019-09-20 13:22:19,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-09-20 13:22:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1499 transitions. [2019-09-20 13:22:19,939 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1499 transitions. Word has length 74 [2019-09-20 13:22:19,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:22:19,941 INFO L475 AbstractCegarLoop]: Abstraction has 1272 states and 1499 transitions. [2019-09-20 13:22:19,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:22:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1499 transitions. [2019-09-20 13:22:19,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-20 13:22:19,948 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:22:19,949 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:22:19,949 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:22:19,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:22:19,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1053464592, now seen corresponding path program 1 times [2019-09-20 13:22:19,950 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:22:19,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:22:19,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:19,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:22:19,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:22:20,163 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-20 13:22:20,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:22:20,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:22:20,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:22:20,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:22:20,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:22:20,167 INFO L87 Difference]: Start difference. First operand 1272 states and 1499 transitions. Second operand 3 states. [2019-09-20 13:22:20,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:22:20,276 INFO L93 Difference]: Finished difference Result 2611 states and 3099 transitions. [2019-09-20 13:22:20,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:22:20,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-09-20 13:22:20,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:22:20,286 INFO L225 Difference]: With dead ends: 2611 [2019-09-20 13:22:20,286 INFO L226 Difference]: Without dead ends: 1359 [2019-09-20 13:22:20,291 INFO L636 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-09-20 13:22:20,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2019-09-20 13:22:20,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1322. [2019-09-20 13:22:20,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-09-20 13:22:20,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1570 transitions. [2019-09-20 13:22:20,375 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1570 transitions. Word has length 232 [2019-09-20 13:22:20,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:22:20,375 INFO L475 AbstractCegarLoop]: Abstraction has 1322 states and 1570 transitions. [2019-09-20 13:22:20,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:22:20,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1570 transitions. [2019-09-20 13:22:20,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-20 13:22:20,382 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:22:20,383 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:22:20,383 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:22:20,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:22:20,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2146120225, now seen corresponding path program 1 times [2019-09-20 13:22:20,384 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:22:20,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:22:20,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:20,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:22:20,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:22:20,543 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-20 13:22:20,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:22:20,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:22:20,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:22:20,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:22:20,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:22:20,545 INFO L87 Difference]: Start difference. First operand 1322 states and 1570 transitions. Second operand 6 states. [2019-09-20 13:22:20,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:22:20,639 INFO L93 Difference]: Finished difference Result 2652 states and 3158 transitions. [2019-09-20 13:22:20,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:22:20,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 251 [2019-09-20 13:22:20,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:22:20,647 INFO L225 Difference]: With dead ends: 2652 [2019-09-20 13:22:20,647 INFO L226 Difference]: Without dead ends: 1350 [2019-09-20 13:22:20,651 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:22:20,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-09-20 13:22:20,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1346. [2019-09-20 13:22:20,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2019-09-20 13:22:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1594 transitions. [2019-09-20 13:22:20,714 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1594 transitions. Word has length 251 [2019-09-20 13:22:20,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:22:20,715 INFO L475 AbstractCegarLoop]: Abstraction has 1346 states and 1594 transitions. [2019-09-20 13:22:20,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:22:20,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1594 transitions. [2019-09-20 13:22:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-20 13:22:20,720 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:22:20,721 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:22:20,721 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:22:20,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:22:20,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2124934682, now seen corresponding path program 1 times [2019-09-20 13:22:20,721 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:22:20,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:22:20,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:20,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:22:20,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:22:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-20 13:22:20,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:22:20,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:22:20,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:22:20,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:22:20,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:22:20,966 INFO L87 Difference]: Start difference. First operand 1346 states and 1594 transitions. Second operand 6 states. [2019-09-20 13:22:21,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:22:21,247 INFO L93 Difference]: Finished difference Result 4086 states and 4858 transitions. [2019-09-20 13:22:21,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:22:21,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 257 [2019-09-20 13:22:21,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:22:21,268 INFO L225 Difference]: With dead ends: 4086 [2019-09-20 13:22:21,269 INFO L226 Difference]: Without dead ends: 2760 [2019-09-20 13:22:21,275 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:22:21,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2019-09-20 13:22:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 1386. [2019-09-20 13:22:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2019-09-20 13:22:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1648 transitions. [2019-09-20 13:22:21,432 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1648 transitions. Word has length 257 [2019-09-20 13:22:21,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:22:21,433 INFO L475 AbstractCegarLoop]: Abstraction has 1386 states and 1648 transitions. [2019-09-20 13:22:21,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:22:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1648 transitions. [2019-09-20 13:22:21,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-20 13:22:21,442 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:22:21,443 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:22:21,443 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:22:21,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:22:21,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1990921176, now seen corresponding path program 1 times [2019-09-20 13:22:21,444 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:22:21,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:22:21,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:21,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:22:21,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:22:21,894 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-20 13:22:21,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:22:21,894 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:22:22,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:22:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:22:22,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 1880 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-20 13:22:22,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:22:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-20 13:22:22,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:22:22,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [11] total 15 [2019-09-20 13:22:22,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-20 13:22:22,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-20 13:22:22,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:22:22,631 INFO L87 Difference]: Start difference. First operand 1386 states and 1648 transitions. Second operand 15 states. [2019-09-20 13:22:22,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:22:22,982 INFO L93 Difference]: Finished difference Result 2900 states and 3484 transitions. [2019-09-20 13:22:22,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-20 13:22:22,983 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 257 [2019-09-20 13:22:22,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:22:22,998 INFO L225 Difference]: With dead ends: 2900 [2019-09-20 13:22:22,999 INFO L226 Difference]: Without dead ends: 1534 [2019-09-20 13:22:23,006 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-09-20 13:22:23,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2019-09-20 13:22:23,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1464. [2019-09-20 13:22:23,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2019-09-20 13:22:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 1742 transitions. [2019-09-20 13:22:23,147 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 1742 transitions. Word has length 257 [2019-09-20 13:22:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:22:23,151 INFO L475 AbstractCegarLoop]: Abstraction has 1464 states and 1742 transitions. [2019-09-20 13:22:23,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-20 13:22:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1742 transitions. [2019-09-20 13:22:23,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-20 13:22:23,162 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:22:23,162 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:22:23,163 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:22:23,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:22:23,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1132371498, now seen corresponding path program 1 times [2019-09-20 13:22:23,164 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:22:23,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:22:23,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:23,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:22:23,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:22:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-20 13:22:23,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:22:23,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:22:23,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:22:23,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:22:23,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:22:23,771 INFO L87 Difference]: Start difference. First operand 1464 states and 1742 transitions. Second operand 8 states. [2019-09-20 13:22:24,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:22:24,786 INFO L93 Difference]: Finished difference Result 3635 states and 4340 transitions. [2019-09-20 13:22:24,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:22:24,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 257 [2019-09-20 13:22:24,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:22:24,801 INFO L225 Difference]: With dead ends: 3635 [2019-09-20 13:22:24,801 INFO L226 Difference]: Without dead ends: 2176 [2019-09-20 13:22:24,808 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:22:24,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2019-09-20 13:22:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2166. [2019-09-20 13:22:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2166 states. [2019-09-20 13:22:24,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 2578 transitions. [2019-09-20 13:22:24,929 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 2578 transitions. Word has length 257 [2019-09-20 13:22:24,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:22:24,930 INFO L475 AbstractCegarLoop]: Abstraction has 2166 states and 2578 transitions. [2019-09-20 13:22:24,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:22:24,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2578 transitions. [2019-09-20 13:22:24,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-20 13:22:24,938 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:22:24,939 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:22:24,939 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:22:24,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:22:24,939 INFO L82 PathProgramCache]: Analyzing trace with hash -68882670, now seen corresponding path program 1 times [2019-09-20 13:22:24,939 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:22:24,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:22:24,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:24,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:22:24,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:22:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-20 13:22:25,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:22:25,214 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:22:25,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:22:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:22:25,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 2219 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-20 13:22:25,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:22:26,240 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:22:26,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:22:26,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-09-20 13:22:26,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:22:26,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:22:26,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:22:26,250 INFO L87 Difference]: Start difference. First operand 2166 states and 2578 transitions. Second operand 5 states. [2019-09-20 13:22:27,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:22:27,395 INFO L93 Difference]: Finished difference Result 8583 states and 10230 transitions. [2019-09-20 13:22:27,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:22:27,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 302 [2019-09-20 13:22:27,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:22:27,442 INFO L225 Difference]: With dead ends: 8583 [2019-09-20 13:22:27,443 INFO L226 Difference]: Without dead ends: 8565 [2019-09-20 13:22:27,450 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:22:27,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8565 states. [2019-09-20 13:22:28,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8565 to 6416. [2019-09-20 13:22:28,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6416 states. [2019-09-20 13:22:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6416 states to 6416 states and 7652 transitions. [2019-09-20 13:22:28,093 INFO L78 Accepts]: Start accepts. Automaton has 6416 states and 7652 transitions. Word has length 302 [2019-09-20 13:22:28,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:22:28,097 INFO L475 AbstractCegarLoop]: Abstraction has 6416 states and 7652 transitions. [2019-09-20 13:22:28,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:22:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 6416 states and 7652 transitions. [2019-09-20 13:22:28,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-20 13:22:28,127 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:22:28,128 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:22:28,128 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:22:28,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:22:28,129 INFO L82 PathProgramCache]: Analyzing trace with hash -202896176, now seen corresponding path program 1 times [2019-09-20 13:22:28,129 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:22:28,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:22:28,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:28,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:22:28,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:22:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-20 13:22:28,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:22:28,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:22:28,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:22:28,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:22:28,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:22:28,387 INFO L87 Difference]: Start difference. First operand 6416 states and 7652 transitions. Second operand 5 states. [2019-09-20 13:22:29,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:22:29,034 INFO L93 Difference]: Finished difference Result 19298 states and 23030 transitions. [2019-09-20 13:22:29,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:22:29,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 302 [2019-09-20 13:22:29,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:22:29,102 INFO L225 Difference]: With dead ends: 19298 [2019-09-20 13:22:29,102 INFO L226 Difference]: Without dead ends: 12902 [2019-09-20 13:22:29,128 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:22:29,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12902 states. [2019-09-20 13:22:29,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12902 to 6476. [2019-09-20 13:22:29,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6476 states. [2019-09-20 13:22:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6476 states to 6476 states and 7724 transitions. [2019-09-20 13:22:29,769 INFO L78 Accepts]: Start accepts. Automaton has 6476 states and 7724 transitions. Word has length 302 [2019-09-20 13:22:29,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:22:29,770 INFO L475 AbstractCegarLoop]: Abstraction has 6476 states and 7724 transitions. [2019-09-20 13:22:29,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:22:29,770 INFO L276 IsEmpty]: Start isEmpty. Operand 6476 states and 7724 transitions. [2019-09-20 13:22:29,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-20 13:22:29,860 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:22:29,861 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:22:29,861 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:22:29,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:22:29,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1291783702, now seen corresponding path program 1 times [2019-09-20 13:22:29,862 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:22:29,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:22:29,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:29,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:22:29,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:22:30,296 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-20 13:22:30,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:22:30,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:22:30,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:22:30,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:22:30,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:22:30,298 INFO L87 Difference]: Start difference. First operand 6476 states and 7724 transitions. Second operand 5 states. [2019-09-20 13:22:30,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:22:30,651 INFO L93 Difference]: Finished difference Result 14348 states and 17714 transitions. [2019-09-20 13:22:30,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:22:30,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 308 [2019-09-20 13:22:30,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:22:30,685 INFO L225 Difference]: With dead ends: 14348 [2019-09-20 13:22:30,685 INFO L226 Difference]: Without dead ends: 7892 [2019-09-20 13:22:30,707 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:22:30,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7892 states. [2019-09-20 13:22:31,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7892 to 7340. [2019-09-20 13:22:31,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7340 states. [2019-09-20 13:22:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7340 states to 7340 states and 9122 transitions. [2019-09-20 13:22:31,117 INFO L78 Accepts]: Start accepts. Automaton has 7340 states and 9122 transitions. Word has length 308 [2019-09-20 13:22:31,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:22:31,117 INFO L475 AbstractCegarLoop]: Abstraction has 7340 states and 9122 transitions. [2019-09-20 13:22:31,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:22:31,118 INFO L276 IsEmpty]: Start isEmpty. Operand 7340 states and 9122 transitions. [2019-09-20 13:22:31,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-20 13:22:31,131 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:22:31,131 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:22:31,132 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:22:31,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:22:31,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1089959768, now seen corresponding path program 1 times [2019-09-20 13:22:31,132 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:22:31,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:22:31,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:31,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:22:31,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:22:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:22:33,143 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.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) 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.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) 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-09-20 13:22:33,149 INFO L168 Benchmark]: Toolchain (without parser) took 19807.18 ms. Allocated memory was 132.6 MB in the beginning and 1.1 GB in the end (delta: 939.5 MB). Free memory was 81.6 MB in the beginning and 580.7 MB in the end (delta: -499.1 MB). Peak memory consumption was 440.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:22:33,150 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 132.6 MB. Free memory was 105.5 MB in the beginning and 105.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:22:33,151 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1622.75 ms. Allocated memory was 132.6 MB in the beginning and 211.8 MB in the end (delta: 79.2 MB). Free memory was 81.4 MB in the beginning and 127.9 MB in the end (delta: -46.5 MB). Peak memory consumption was 40.0 MB. Max. memory is 7.1 GB. [2019-09-20 13:22:33,151 INFO L168 Benchmark]: Boogie Preprocessor took 195.26 ms. Allocated memory is still 211.8 MB. Free memory was 127.9 MB in the beginning and 119.3 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:22:33,153 INFO L168 Benchmark]: RCFGBuilder took 1762.57 ms. Allocated memory was 211.8 MB in the beginning and 273.2 MB in the end (delta: 61.3 MB). Free memory was 119.3 MB in the beginning and 124.2 MB in the end (delta: -4.9 MB). Peak memory consumption was 66.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:22:33,154 INFO L168 Benchmark]: TraceAbstraction took 16221.32 ms. Allocated memory was 273.2 MB in the beginning and 1.1 GB in the end (delta: 799.0 MB). Free memory was 124.2 MB in the beginning and 580.7 MB in the end (delta: -456.6 MB). Peak memory consumption was 342.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:22:33,157 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41 ms. Allocated memory is still 132.6 MB. Free memory was 105.5 MB in the beginning and 105.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1622.75 ms. Allocated memory was 132.6 MB in the beginning and 211.8 MB in the end (delta: 79.2 MB). Free memory was 81.4 MB in the beginning and 127.9 MB in the end (delta: -46.5 MB). Peak memory consumption was 40.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 195.26 ms. Allocated memory is still 211.8 MB. Free memory was 127.9 MB in the beginning and 119.3 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1762.57 ms. Allocated memory was 211.8 MB in the beginning and 273.2 MB in the end (delta: 61.3 MB). Free memory was 119.3 MB in the beginning and 124.2 MB in the end (delta: -4.9 MB). Peak memory consumption was 66.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16221.32 ms. Allocated memory was 273.2 MB in the beginning and 1.1 GB in the end (delta: 799.0 MB). Free memory was 124.2 MB in the beginning and 580.7 MB in the end (delta: -456.6 MB). Peak memory consumption was 342.4 MB. Max. memory is 7.1 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...