/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--input--gameport--gameport.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 03:26:23,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 03:26:23,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 03:26:23,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 03:26:23,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 03:26:23,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 03:26:23,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 03:26:23,579 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 03:26:23,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 03:26:23,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 03:26:23,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 03:26:23,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 03:26:23,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 03:26:23,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 03:26:23,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 03:26:23,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 03:26:23,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 03:26:23,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 03:26:23,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 03:26:23,592 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 03:26:23,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 03:26:23,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 03:26:23,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 03:26:23,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 03:26:23,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 03:26:23,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 03:26:23,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 03:26:23,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 03:26:23,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 03:26:23,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 03:26:23,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 03:26:23,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 03:26:23,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 03:26:23,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 03:26:23,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 03:26:23,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 03:26:23,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 03:26:23,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 03:26:23,607 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 03:26:23,608 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 03:26:23,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 03:26:23,609 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 03:26:23,627 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 03:26:23,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 03:26:23,630 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 03:26:23,631 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 03:26:23,631 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 03:26:23,631 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 03:26:23,631 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 03:26:23,631 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 03:26:23,632 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 03:26:23,632 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 03:26:23,632 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 03:26:23,632 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 03:26:23,632 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 03:26:23,633 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 03:26:23,633 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 03:26:23,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 03:26:23,634 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 03:26:23,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 03:26:23,634 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 03:26:23,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 03:26:23,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 03:26:23,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 03:26:23,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 03:26:23,635 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 03:26:23,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 03:26:23,635 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 03:26:23,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 03:26:23,636 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 03:26:23,636 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 03:26:23,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 03:26:23,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 03:26:23,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 03:26:23,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 03:26:23,638 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 03:26:23,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 03:26:23,638 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 03:26:23,638 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 03:26:23,639 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 03:26:23,955 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 03:26:23,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 03:26:23,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 03:26:23,984 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 03:26:23,985 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 03:26:23,985 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--input--gameport--gameport.ko-entry_point.cil.out.i [2019-11-24 03:26:24,069 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6210af580/cf52b0f54bee4f3db32f6d45df7fe499/FLAGd173d5693 [2019-11-24 03:26:24,801 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 03:26:24,802 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--input--gameport--gameport.ko-entry_point.cil.out.i [2019-11-24 03:26:24,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6210af580/cf52b0f54bee4f3db32f6d45df7fe499/FLAGd173d5693 [2019-11-24 03:26:24,889 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6210af580/cf52b0f54bee4f3db32f6d45df7fe499 [2019-11-24 03:26:24,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 03:26:24,898 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 03:26:24,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 03:26:24,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 03:26:24,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 03:26:24,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 03:26:24" (1/1) ... [2019-11-24 03:26:24,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b17f101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:26:24, skipping insertion in model container [2019-11-24 03:26:24,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 03:26:24" (1/1) ... [2019-11-24 03:26:24,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 03:26:25,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 03:26:26,451 WARN L612 FunctionHandler]: implicit declaration of function ldv_xmalloc [2019-11-24 03:26:26,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 03:26:26,522 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 03:26:26,877 WARN L612 FunctionHandler]: implicit declaration of function ldv_xmalloc [2019-11-24 03:26:26,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 03:26:27,301 INFO L208 MainTranslator]: Completed translation [2019-11-24 03:26:27,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:26:27 WrapperNode [2019-11-24 03:26:27,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 03:26:27,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 03:26:27,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 03:26:27,303 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 03:26:27,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:26:27" (1/1) ... [2019-11-24 03:26:27,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:26:27" (1/1) ... [2019-11-24 03:26:27,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 03:26:27,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 03:26:27,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 03:26:27,575 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 03:26:27,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:26:27" (1/1) ... [2019-11-24 03:26:27,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:26:27" (1/1) ... [2019-11-24 03:26:27,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:26:27" (1/1) ... [2019-11-24 03:26:27,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:26:27" (1/1) ... [2019-11-24 03:26:27,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:26:27" (1/1) ... [2019-11-24 03:26:27,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:26:27" (1/1) ... [2019-11-24 03:26:27,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:26:27" (1/1) ... [2019-11-24 03:26:27,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 03:26:27,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 03:26:27,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 03:26:27,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 03:26:27,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:26:27" (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-11-24 03:26:27,858 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-24 03:26:27,858 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_add_port [2019-11-24 03:26:27,859 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_add_port [2019-11-24 03:26:27,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 03:26:27,859 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_size_call_parameter [2019-11-24 03:26:27,859 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_read [2019-11-24 03:26:27,859 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_read [2019-11-24 03:26:27,859 INFO L130 BoogieDeclarations]: Found specification of procedure old_gameport_measure_speed [2019-11-24 03:26:27,862 INFO L138 BoogieDeclarations]: Found implementation of procedure old_gameport_measure_speed [2019-11-24 03:26:27,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 03:26:27,862 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_driver_remove [2019-11-24 03:26:27,862 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_driver_remove [2019-11-24 03:26:27,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 03:26:27,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 03:26:27,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 03:26:27,863 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2019-11-24 03:26:27,863 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-24 03:26:27,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-24 03:26:27,864 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2019-11-24 03:26:27,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2019-11-24 03:26:27,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 03:26:27,864 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2019-11-24 03:26:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 03:26:27,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 03:26:27,866 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_measure_speed [2019-11-24 03:26:27,866 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_measure_speed [2019-11-24 03:26:27,866 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_close [2019-11-24 03:26:27,867 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_close [2019-11-24 03:26:27,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 03:26:27,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 03:26:27,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 03:26:27,867 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_handle_events [2019-11-24 03:26:27,867 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_handle_events [2019-11-24 03:26:38,972 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 03:26:38,973 INFO L284 CfgBuilder]: Removed 1110 assume(true) statements. [2019-11-24 03:26:38,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 03:26:38 BoogieIcfgContainer [2019-11-24 03:26:38,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 03:26:38,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 03:26:38,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 03:26:38,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 03:26:38,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 03:26:24" (1/3) ... [2019-11-24 03:26:38,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15539db4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 03:26:38, skipping insertion in model container [2019-11-24 03:26:38,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:26:27" (2/3) ... [2019-11-24 03:26:38,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15539db4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 03:26:38, skipping insertion in model container [2019-11-24 03:26:38,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 03:26:38" (3/3) ... [2019-11-24 03:26:38,985 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--input--gameport--gameport.ko-entry_point.cil.out.i [2019-11-24 03:26:38,996 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 03:26:39,005 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2019-11-24 03:26:39,017 INFO L249 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2019-11-24 03:26:39,054 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 03:26:39,055 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 03:26:39,055 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 03:26:39,056 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 03:26:39,056 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 03:26:39,056 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 03:26:39,056 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 03:26:39,056 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 03:26:39,101 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states. [2019-11-24 03:26:39,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 03:26:39,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:26:39,117 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:26:39,118 INFO L410 AbstractCegarLoop]: === Iteration 1 === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr7ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr5ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr6ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr3ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr1ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:26:39,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:26:39,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1313789259, now seen corresponding path program 1 times [2019-11-24 03:26:39,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:26:39,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803803118] [2019-11-24 03:26:39,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:26:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:26:39,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:26:39,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803803118] [2019-11-24 03:26:39,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:26:39,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:26:39,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715027794] [2019-11-24 03:26:39,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:26:39,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:26:39,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:26:39,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:39,846 INFO L87 Difference]: Start difference. First operand 493 states. Second operand 3 states. [2019-11-24 03:26:40,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:26:40,616 INFO L93 Difference]: Finished difference Result 1448 states and 2233 transitions. [2019-11-24 03:26:40,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:26:40,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 03:26:40,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:26:40,650 INFO L225 Difference]: With dead ends: 1448 [2019-11-24 03:26:40,650 INFO L226 Difference]: Without dead ends: 925 [2019-11-24 03:26:40,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:40,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2019-11-24 03:26:40,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 885. [2019-11-24 03:26:40,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-11-24 03:26:40,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1318 transitions. [2019-11-24 03:26:40,795 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1318 transitions. Word has length 25 [2019-11-24 03:26:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:26:40,796 INFO L462 AbstractCegarLoop]: Abstraction has 885 states and 1318 transitions. [2019-11-24 03:26:40,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:26:40,796 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1318 transitions. [2019-11-24 03:26:40,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 03:26:40,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:26:40,801 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:26:40,802 INFO L410 AbstractCegarLoop]: === Iteration 2 === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr7ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr5ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr6ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr3ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr1ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:26:40,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:26:40,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1780098185, now seen corresponding path program 1 times [2019-11-24 03:26:40,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:26:40,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109740850] [2019-11-24 03:26:40,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:26:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:26:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:26:41,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109740850] [2019-11-24 03:26:41,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:26:41,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 03:26:41,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571465545] [2019-11-24 03:26:41,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 03:26:41,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:26:41,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 03:26:41,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 03:26:41,007 INFO L87 Difference]: Start difference. First operand 885 states and 1318 transitions. Second operand 5 states. [2019-11-24 03:26:41,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:26:41,615 INFO L93 Difference]: Finished difference Result 3496 states and 5275 transitions. [2019-11-24 03:26:41,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 03:26:41,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-24 03:26:41,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:26:41,651 INFO L225 Difference]: With dead ends: 3496 [2019-11-24 03:26:41,651 INFO L226 Difference]: Without dead ends: 2623 [2019-11-24 03:26:41,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 03:26:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2019-11-24 03:26:41,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2529. [2019-11-24 03:26:41,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2529 states. [2019-11-24 03:26:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2529 states and 3922 transitions. [2019-11-24 03:26:41,914 INFO L78 Accepts]: Start accepts. Automaton has 2529 states and 3922 transitions. Word has length 28 [2019-11-24 03:26:41,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:26:41,916 INFO L462 AbstractCegarLoop]: Abstraction has 2529 states and 3922 transitions. [2019-11-24 03:26:41,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 03:26:41,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2529 states and 3922 transitions. [2019-11-24 03:26:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 03:26:41,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:26:41,927 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:26:41,927 INFO L410 AbstractCegarLoop]: === Iteration 3 === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr7ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr5ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr6ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr3ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr1ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:26:41,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:26:41,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1270048545, now seen corresponding path program 1 times [2019-11-24 03:26:41,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:26:41,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583073813] [2019-11-24 03:26:41,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:26:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:26:42,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:26:42,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583073813] [2019-11-24 03:26:42,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:26:42,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 03:26:42,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743923115] [2019-11-24 03:26:42,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:26:42,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:26:42,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:26:42,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:42,309 INFO L87 Difference]: Start difference. First operand 2529 states and 3922 transitions. Second operand 3 states. [2019-11-24 03:26:42,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:26:42,505 INFO L93 Difference]: Finished difference Result 4924 states and 7912 transitions. [2019-11-24 03:26:42,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:26:42,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-24 03:26:42,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:26:42,525 INFO L225 Difference]: With dead ends: 4924 [2019-11-24 03:26:42,525 INFO L226 Difference]: Without dead ends: 2406 [2019-11-24 03:26:42,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:42,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2406 states. [2019-11-24 03:26:42,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2406 to 2306. [2019-11-24 03:26:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2306 states. [2019-11-24 03:26:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3571 transitions. [2019-11-24 03:26:42,700 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3571 transitions. Word has length 28 [2019-11-24 03:26:42,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:26:42,701 INFO L462 AbstractCegarLoop]: Abstraction has 2306 states and 3571 transitions. [2019-11-24 03:26:42,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:26:42,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3571 transitions. [2019-11-24 03:26:42,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 03:26:42,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:26:42,703 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:26:42,704 INFO L410 AbstractCegarLoop]: === Iteration 4 === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr7ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr5ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr6ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr3ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr1ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:26:42,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:26:42,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1109910766, now seen corresponding path program 1 times [2019-11-24 03:26:42,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:26:42,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975213484] [2019-11-24 03:26:42,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:26:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:26:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:26:42,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975213484] [2019-11-24 03:26:42,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:26:42,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:26:42,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544468454] [2019-11-24 03:26:42,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:26:42,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:26:42,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:26:42,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:42,942 INFO L87 Difference]: Start difference. First operand 2306 states and 3571 transitions. Second operand 3 states. [2019-11-24 03:26:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:26:43,257 INFO L93 Difference]: Finished difference Result 6858 states and 10606 transitions. [2019-11-24 03:26:43,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:26:43,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-24 03:26:43,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:26:43,301 INFO L225 Difference]: With dead ends: 6858 [2019-11-24 03:26:43,301 INFO L226 Difference]: Without dead ends: 4564 [2019-11-24 03:26:43,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:43,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4564 states. [2019-11-24 03:26:43,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4564 to 4504. [2019-11-24 03:26:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4504 states. [2019-11-24 03:26:43,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4504 states to 4504 states and 7012 transitions. [2019-11-24 03:26:43,597 INFO L78 Accepts]: Start accepts. Automaton has 4504 states and 7012 transitions. Word has length 29 [2019-11-24 03:26:43,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:26:43,598 INFO L462 AbstractCegarLoop]: Abstraction has 4504 states and 7012 transitions. [2019-11-24 03:26:43,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:26:43,599 INFO L276 IsEmpty]: Start isEmpty. Operand 4504 states and 7012 transitions. [2019-11-24 03:26:43,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 03:26:43,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:26:43,602 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:26:43,602 INFO L410 AbstractCegarLoop]: === Iteration 5 === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr7ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr5ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr6ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr3ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr1ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:26:43,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:26:43,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1814531416, now seen corresponding path program 1 times [2019-11-24 03:26:43,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:26:43,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535186220] [2019-11-24 03:26:43,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:26:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:26:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:26:43,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535186220] [2019-11-24 03:26:43,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:26:43,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:26:43,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762959905] [2019-11-24 03:26:43,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:26:43,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:26:43,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:26:43,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:43,833 INFO L87 Difference]: Start difference. First operand 4504 states and 7012 transitions. Second operand 3 states. [2019-11-24 03:26:45,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:26:45,058 INFO L93 Difference]: Finished difference Result 13398 states and 20829 transitions. [2019-11-24 03:26:45,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:26:45,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-24 03:26:45,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:26:45,114 INFO L225 Difference]: With dead ends: 13398 [2019-11-24 03:26:45,115 INFO L226 Difference]: Without dead ends: 8906 [2019-11-24 03:26:45,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:45,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8906 states. [2019-11-24 03:26:45,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8906 to 8846. [2019-11-24 03:26:45,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8846 states. [2019-11-24 03:26:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8846 states to 8846 states and 13788 transitions. [2019-11-24 03:26:45,587 INFO L78 Accepts]: Start accepts. Automaton has 8846 states and 13788 transitions. Word has length 31 [2019-11-24 03:26:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:26:45,588 INFO L462 AbstractCegarLoop]: Abstraction has 8846 states and 13788 transitions. [2019-11-24 03:26:45,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:26:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 8846 states and 13788 transitions. [2019-11-24 03:26:45,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 03:26:45,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:26:45,589 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:26:45,589 INFO L410 AbstractCegarLoop]: === Iteration 6 === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr7ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr5ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr6ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr3ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr1ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:26:45,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:26:45,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1313730819, now seen corresponding path program 1 times [2019-11-24 03:26:45,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:26:45,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884024489] [2019-11-24 03:26:45,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:26:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:26:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:26:45,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884024489] [2019-11-24 03:26:45,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:26:45,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:26:45,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139760976] [2019-11-24 03:26:45,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:26:45,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:26:45,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:26:45,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:45,903 INFO L87 Difference]: Start difference. First operand 8846 states and 13788 transitions. Second operand 3 states. [2019-11-24 03:26:46,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:26:46,454 INFO L93 Difference]: Finished difference Result 17632 states and 27465 transitions. [2019-11-24 03:26:46,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:26:46,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-24 03:26:46,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:26:46,506 INFO L225 Difference]: With dead ends: 17632 [2019-11-24 03:26:46,507 INFO L226 Difference]: Without dead ends: 8798 [2019-11-24 03:26:46,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:46,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8798 states. [2019-11-24 03:26:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8798 to 8798. [2019-11-24 03:26:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8798 states. [2019-11-24 03:26:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8798 states to 8798 states and 13676 transitions. [2019-11-24 03:26:47,012 INFO L78 Accepts]: Start accepts. Automaton has 8798 states and 13676 transitions. Word has length 31 [2019-11-24 03:26:47,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:26:47,013 INFO L462 AbstractCegarLoop]: Abstraction has 8798 states and 13676 transitions. [2019-11-24 03:26:47,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:26:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 8798 states and 13676 transitions. [2019-11-24 03:26:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 03:26:47,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:26:47,014 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:26:47,014 INFO L410 AbstractCegarLoop]: === Iteration 7 === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr7ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr5ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr6ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr3ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr1ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:26:47,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:26:47,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1391779682, now seen corresponding path program 1 times [2019-11-24 03:26:47,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:26:47,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164620877] [2019-11-24 03:26:47,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:26:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:26:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:26:47,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164620877] [2019-11-24 03:26:47,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:26:47,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:26:47,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459624980] [2019-11-24 03:26:47,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:26:47,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:26:47,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:26:47,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:47,250 INFO L87 Difference]: Start difference. First operand 8798 states and 13676 transitions. Second operand 3 states. [2019-11-24 03:26:47,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:26:47,737 INFO L93 Difference]: Finished difference Result 17536 states and 27241 transitions. [2019-11-24 03:26:47,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:26:47,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-24 03:26:47,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:26:47,777 INFO L225 Difference]: With dead ends: 17536 [2019-11-24 03:26:47,777 INFO L226 Difference]: Without dead ends: 8750 [2019-11-24 03:26:47,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:47,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8750 states. [2019-11-24 03:26:48,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8750 to 8750. [2019-11-24 03:26:48,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8750 states. [2019-11-24 03:26:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8750 states to 8750 states and 13564 transitions. [2019-11-24 03:26:48,433 INFO L78 Accepts]: Start accepts. Automaton has 8750 states and 13564 transitions. Word has length 32 [2019-11-24 03:26:48,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:26:48,433 INFO L462 AbstractCegarLoop]: Abstraction has 8750 states and 13564 transitions. [2019-11-24 03:26:48,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:26:48,434 INFO L276 IsEmpty]: Start isEmpty. Operand 8750 states and 13564 transitions. [2019-11-24 03:26:48,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-24 03:26:48,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:26:48,435 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:26:48,435 INFO L410 AbstractCegarLoop]: === Iteration 8 === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr7ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr5ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr6ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr3ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr1ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:26:48,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:26:48,435 INFO L82 PathProgramCache]: Analyzing trace with hash 678603814, now seen corresponding path program 1 times [2019-11-24 03:26:48,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:26:48,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566053378] [2019-11-24 03:26:48,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:26:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:26:48,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:26:48,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566053378] [2019-11-24 03:26:48,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:26:48,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:26:48,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570619977] [2019-11-24 03:26:48,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:26:48,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:26:48,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:26:48,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:48,679 INFO L87 Difference]: Start difference. First operand 8750 states and 13564 transitions. Second operand 3 states. [2019-11-24 03:26:49,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:26:49,195 INFO L93 Difference]: Finished difference Result 17440 states and 27017 transitions. [2019-11-24 03:26:49,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:26:49,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-24 03:26:49,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:26:49,229 INFO L225 Difference]: With dead ends: 17440 [2019-11-24 03:26:49,229 INFO L226 Difference]: Without dead ends: 8702 [2019-11-24 03:26:49,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:49,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8702 states. [2019-11-24 03:26:49,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8702 to 8702. [2019-11-24 03:26:49,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8702 states. [2019-11-24 03:26:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8702 states to 8702 states and 13452 transitions. [2019-11-24 03:26:49,768 INFO L78 Accepts]: Start accepts. Automaton has 8702 states and 13452 transitions. Word has length 33 [2019-11-24 03:26:49,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:26:49,769 INFO L462 AbstractCegarLoop]: Abstraction has 8702 states and 13452 transitions. [2019-11-24 03:26:49,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:26:49,769 INFO L276 IsEmpty]: Start isEmpty. Operand 8702 states and 13452 transitions. [2019-11-24 03:26:49,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 03:26:49,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:26:49,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:26:49,771 INFO L410 AbstractCegarLoop]: === Iteration 9 === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr7ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr5ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr6ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr3ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr1ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:26:49,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:26:49,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1360332907, now seen corresponding path program 1 times [2019-11-24 03:26:49,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:26:49,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887638655] [2019-11-24 03:26:49,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:26:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:26:50,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:26:50,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887638655] [2019-11-24 03:26:50,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:26:50,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:26:50,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809458541] [2019-11-24 03:26:50,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:26:50,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:26:50,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:26:50,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:50,035 INFO L87 Difference]: Start difference. First operand 8702 states and 13452 transitions. Second operand 3 states. [2019-11-24 03:26:50,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:26:50,484 INFO L93 Difference]: Finished difference Result 17344 states and 26793 transitions. [2019-11-24 03:26:50,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:26:50,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-24 03:26:50,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:26:50,533 INFO L225 Difference]: With dead ends: 17344 [2019-11-24 03:26:50,533 INFO L226 Difference]: Without dead ends: 8654 [2019-11-24 03:26:50,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:50,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8654 states. [2019-11-24 03:26:51,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8654 to 8654. [2019-11-24 03:26:51,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8654 states. [2019-11-24 03:26:51,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8654 states to 8654 states and 13340 transitions. [2019-11-24 03:26:51,099 INFO L78 Accepts]: Start accepts. Automaton has 8654 states and 13340 transitions. Word has length 34 [2019-11-24 03:26:51,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:26:51,099 INFO L462 AbstractCegarLoop]: Abstraction has 8654 states and 13340 transitions. [2019-11-24 03:26:51,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:26:51,100 INFO L276 IsEmpty]: Start isEmpty. Operand 8654 states and 13340 transitions. [2019-11-24 03:26:51,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-24 03:26:51,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:26:51,103 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:26:51,103 INFO L410 AbstractCegarLoop]: === Iteration 10 === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr7ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr5ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr6ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr3ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr1ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:26:51,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:26:51,103 INFO L82 PathProgramCache]: Analyzing trace with hash -396845037, now seen corresponding path program 1 times [2019-11-24 03:26:51,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:26:51,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940077767] [2019-11-24 03:26:51,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:26:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:26:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:26:51,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940077767] [2019-11-24 03:26:51,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:26:51,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:26:51,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10483628] [2019-11-24 03:26:51,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:26:51,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:26:51,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:26:51,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:51,321 INFO L87 Difference]: Start difference. First operand 8654 states and 13340 transitions. Second operand 3 states. [2019-11-24 03:26:51,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:26:51,859 INFO L93 Difference]: Finished difference Result 21934 states and 33685 transitions. [2019-11-24 03:26:51,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:26:51,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-24 03:26:51,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:26:51,904 INFO L225 Difference]: With dead ends: 21934 [2019-11-24 03:26:51,905 INFO L226 Difference]: Without dead ends: 13292 [2019-11-24 03:26:51,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:51,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13292 states. [2019-11-24 03:26:52,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13292 to 13262. [2019-11-24 03:26:52,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13262 states. [2019-11-24 03:26:52,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13262 states to 13262 states and 20324 transitions. [2019-11-24 03:26:52,611 INFO L78 Accepts]: Start accepts. Automaton has 13262 states and 20324 transitions. Word has length 38 [2019-11-24 03:26:52,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:26:52,612 INFO L462 AbstractCegarLoop]: Abstraction has 13262 states and 20324 transitions. [2019-11-24 03:26:52,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:26:52,612 INFO L276 IsEmpty]: Start isEmpty. Operand 13262 states and 20324 transitions. [2019-11-24 03:26:52,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-24 03:26:52,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:26:52,614 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:26:52,614 INFO L410 AbstractCegarLoop]: === Iteration 11 === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr7ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr5ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr6ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr3ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr1ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:26:52,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:26:52,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1991990147, now seen corresponding path program 1 times [2019-11-24 03:26:52,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:26:52,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068833479] [2019-11-24 03:26:52,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:26:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:26:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 03:26:53,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068833479] [2019-11-24 03:26:53,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:26:53,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 03:26:53,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95977518] [2019-11-24 03:26:53,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:26:53,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:26:53,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:26:53,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:53,136 INFO L87 Difference]: Start difference. First operand 13262 states and 20324 transitions. Second operand 3 states. [2019-11-24 03:26:53,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:26:53,657 INFO L93 Difference]: Finished difference Result 26535 states and 40671 transitions. [2019-11-24 03:26:53,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:26:53,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-24 03:26:53,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:26:53,706 INFO L225 Difference]: With dead ends: 26535 [2019-11-24 03:26:53,707 INFO L226 Difference]: Without dead ends: 13275 [2019-11-24 03:26:53,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:53,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13275 states. [2019-11-24 03:26:54,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13275 to 13275. [2019-11-24 03:26:54,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13275 states. [2019-11-24 03:26:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13275 states to 13275 states and 20337 transitions. [2019-11-24 03:26:54,595 INFO L78 Accepts]: Start accepts. Automaton has 13275 states and 20337 transitions. Word has length 44 [2019-11-24 03:26:54,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:26:54,595 INFO L462 AbstractCegarLoop]: Abstraction has 13275 states and 20337 transitions. [2019-11-24 03:26:54,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:26:54,596 INFO L276 IsEmpty]: Start isEmpty. Operand 13275 states and 20337 transitions. [2019-11-24 03:26:54,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 03:26:54,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:26:54,597 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:26:54,598 INFO L410 AbstractCegarLoop]: === Iteration 12 === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr7ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr5ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr6ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr3ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr1ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:26:54,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:26:54,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1088192174, now seen corresponding path program 1 times [2019-11-24 03:26:54,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:26:54,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942279336] [2019-11-24 03:26:54,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:26:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:26:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-24 03:26:55,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942279336] [2019-11-24 03:26:55,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:26:55,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:26:55,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845099253] [2019-11-24 03:26:55,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:26:55,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:26:55,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:26:55,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:55,860 INFO L87 Difference]: Start difference. First operand 13275 states and 20337 transitions. Second operand 3 states. [2019-11-24 03:26:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:26:56,481 INFO L93 Difference]: Finished difference Result 26529 states and 40643 transitions. [2019-11-24 03:26:56,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:26:56,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-24 03:26:56,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:26:56,525 INFO L225 Difference]: With dead ends: 26529 [2019-11-24 03:26:56,526 INFO L226 Difference]: Without dead ends: 13276 [2019-11-24 03:26:56,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:26:56,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13276 states. [2019-11-24 03:26:57,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13276 to 13276. [2019-11-24 03:26:57,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13276 states. [2019-11-24 03:26:57,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13276 states to 13276 states and 20338 transitions. [2019-11-24 03:26:57,123 INFO L78 Accepts]: Start accepts. Automaton has 13276 states and 20338 transitions. Word has length 55 [2019-11-24 03:26:57,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:26:57,124 INFO L462 AbstractCegarLoop]: Abstraction has 13276 states and 20338 transitions. [2019-11-24 03:26:57,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:26:57,124 INFO L276 IsEmpty]: Start isEmpty. Operand 13276 states and 20338 transitions. [2019-11-24 03:26:57,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-24 03:26:57,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:26:57,126 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:26:57,127 INFO L410 AbstractCegarLoop]: === Iteration 13 === [##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr7ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr5ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr2ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr6ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr3ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr1ASSERT_VIOLATIONERROR_FUNCTION, gameport_handle_eventsErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:26:57,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:26:57,128 INFO L82 PathProgramCache]: Analyzing trace with hash -2044614967, now seen corresponding path program 1 times [2019-11-24 03:26:57,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:26:57,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909293515] [2019-11-24 03:26:57,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:26:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:26:59,501 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-24 03:26:59,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909293515] [2019-11-24 03:26:59,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669949926] [2019-11-24 03:26:59,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 03:27:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:27:08,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 2162 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-24 03:27:08,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 03:27:08,601 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-24 03:27:08,601 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 03:27:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-24 03:27:08,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [474781600] [2019-11-24 03:27:08,690 INFO L159 IcfgInterpreter]: Started Sifa with 41 locations of interest [2019-11-24 03:27:08,691 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 03:27:08,699 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 03:27:08,706 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 03:27:08,707 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs