/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-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--nfc--st21nfca--st21nfca_i2c.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 02:04:05,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 02:04:05,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 02:04:05,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 02:04:05,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 02:04:05,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 02:04:05,404 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 02:04:05,406 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 02:04:05,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 02:04:05,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 02:04:05,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 02:04:05,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 02:04:05,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 02:04:05,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 02:04:05,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 02:04:05,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 02:04:05,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 02:04:05,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 02:04:05,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 02:04:05,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 02:04:05,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 02:04:05,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 02:04:05,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 02:04:05,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 02:04:05,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 02:04:05,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 02:04:05,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 02:04:05,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 02:04:05,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 02:04:05,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 02:04:05,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 02:04:05,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 02:04:05,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 02:04:05,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 02:04:05,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 02:04:05,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 02:04:05,435 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 02:04:05,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 02:04:05,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 02:04:05,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 02:04:05,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 02:04:05,438 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 02:04:05,453 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 02:04:05,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 02:04:05,454 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 02:04:05,455 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 02:04:05,455 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 02:04:05,455 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 02:04:05,455 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 02:04:05,456 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 02:04:05,456 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 02:04:05,456 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 02:04:05,456 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 02:04:05,456 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 02:04:05,457 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 02:04:05,457 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 02:04:05,457 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 02:04:05,458 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 02:04:05,458 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 02:04:05,458 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 02:04:05,458 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 02:04:05,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 02:04:05,459 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 02:04:05,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 02:04:05,459 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 02:04:05,459 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 02:04:05,460 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 02:04:05,460 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 02:04:05,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 02:04:05,461 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 02:04:05,461 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 02:04:05,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 02:04:05,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 02:04:05,462 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 02:04:05,462 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 02:04:05,462 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 02:04:05,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 02:04:05,462 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 02:04:05,463 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 02:04:05,464 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 02:04:05,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 02:04:05,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 02:04:05,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 02:04:05,795 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 02:04:05,795 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 02:04:05,796 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--nfc--st21nfca--st21nfca_i2c.ko-entry_point.cil.out.i [2019-11-24 02:04:05,871 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bcef0ac7/270e1c992dcf45689b393baef9255223/FLAGb74a337c0 [2019-11-24 02:04:06,614 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 02:04:06,614 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--nfc--st21nfca--st21nfca_i2c.ko-entry_point.cil.out.i [2019-11-24 02:04:06,657 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bcef0ac7/270e1c992dcf45689b393baef9255223/FLAGb74a337c0 [2019-11-24 02:04:06,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bcef0ac7/270e1c992dcf45689b393baef9255223 [2019-11-24 02:04:06,729 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 02:04:06,731 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 02:04:06,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 02:04:06,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 02:04:06,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 02:04:06,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 02:04:06" (1/1) ... [2019-11-24 02:04:06,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1f63e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:04:06, skipping insertion in model container [2019-11-24 02:04:06,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 02:04:06" (1/1) ... [2019-11-24 02:04:06,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 02:04:06,851 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 02:04:07,438 WARN L1172 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [2704] [2019-11-24 02:04:07,439 WARN L1172 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [2705-2706] [2019-11-24 02:04:08,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 02:04:08,183 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 02:04:08,289 WARN L1172 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [2704] [2019-11-24 02:04:08,289 WARN L1172 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [2705-2706] [2019-11-24 02:04:08,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 02:04:08,616 INFO L208 MainTranslator]: Completed translation [2019-11-24 02:04:08,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:04:08 WrapperNode [2019-11-24 02:04:08,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 02:04:08,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 02:04:08,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 02:04:08,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 02:04:08,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:04:08" (1/1) ... [2019-11-24 02:04:08,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:04:08" (1/1) ... [2019-11-24 02:04:08,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 02:04:08,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 02:04:08,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 02:04:08,996 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 02:04:09,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:04:08" (1/1) ... [2019-11-24 02:04:09,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:04:08" (1/1) ... [2019-11-24 02:04:09,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:04:08" (1/1) ... [2019-11-24 02:04:09,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:04:08" (1/1) ... [2019-11-24 02:04:09,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:04:08" (1/1) ... [2019-11-24 02:04:09,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:04:08" (1/1) ... [2019-11-24 02:04:09,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:04:08" (1/1) ... [2019-11-24 02:04:09,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 02:04:09,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 02:04:09,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 02:04:09,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 02:04:09,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:04:08" (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 02:04:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-11-24 02:04:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-24 02:04:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-24 02:04:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 02:04:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 02:04:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 02:04:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 02:04:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 02:04:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 02:04:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 02:04:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 02:04:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 02:04:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-11-24 02:04:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 02:04:09,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 02:04:34,745 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 02:04:34,745 INFO L284 CfgBuilder]: Removed 895 assume(true) statements. [2019-11-24 02:04:34,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:04:34 BoogieIcfgContainer [2019-11-24 02:04:34,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 02:04:34,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 02:04:34,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 02:04:34,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 02:04:34,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 02:04:06" (1/3) ... [2019-11-24 02:04:34,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e193e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 02:04:34, skipping insertion in model container [2019-11-24 02:04:34,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:04:08" (2/3) ... [2019-11-24 02:04:34,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e193e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 02:04:34, skipping insertion in model container [2019-11-24 02:04:34,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:04:34" (3/3) ... [2019-11-24 02:04:34,756 INFO L109 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--nfc--st21nfca--st21nfca_i2c.ko-entry_point.cil.out.i [2019-11-24 02:04:34,766 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 02:04:34,775 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-11-24 02:04:34,785 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-11-24 02:04:34,813 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 02:04:34,813 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 02:04:34,813 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 02:04:34,813 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 02:04:34,813 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 02:04:34,813 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 02:04:34,814 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 02:04:34,814 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 02:04:34,841 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states. [2019-11-24 02:04:34,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 02:04:34,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:04:34,858 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] [2019-11-24 02:04:34,858 INFO L410 AbstractCegarLoop]: === Iteration 1 === [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.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:04:34,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:04:34,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1744510857, now seen corresponding path program 1 times [2019-11-24 02:04:34,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:04:34,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113675160] [2019-11-24 02:04:34,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:04:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:04:35,426 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 02:04:35,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113675160] [2019-11-24 02:04:35,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 02:04:35,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 02:04:35,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483439253] [2019-11-24 02:04:35,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 02:04:35,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:04:35,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 02:04:35,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 02:04:35,451 INFO L87 Difference]: Start difference. First operand 378 states. Second operand 3 states. [2019-11-24 02:04:35,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:04:35,724 INFO L93 Difference]: Finished difference Result 1066 states and 1783 transitions. [2019-11-24 02:04:35,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 02:04:35,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 02:04:35,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:04:35,751 INFO L225 Difference]: With dead ends: 1066 [2019-11-24 02:04:35,751 INFO L226 Difference]: Without dead ends: 673 [2019-11-24 02:04:35,763 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 02:04:35,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-11-24 02:04:35,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 657. [2019-11-24 02:04:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-11-24 02:04:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1091 transitions. [2019-11-24 02:04:35,879 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1091 transitions. Word has length 23 [2019-11-24 02:04:35,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:04:35,879 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 1091 transitions. [2019-11-24 02:04:35,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 02:04:35,880 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1091 transitions. [2019-11-24 02:04:35,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 02:04:35,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:04:35,886 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 02:04:35,887 INFO L410 AbstractCegarLoop]: === Iteration 2 === [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.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:04:35,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:04:35,887 INFO L82 PathProgramCache]: Analyzing trace with hash 203693341, now seen corresponding path program 1 times [2019-11-24 02:04:35,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:04:35,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238483035] [2019-11-24 02:04:35,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:04:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:04:36,080 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 02:04:36,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238483035] [2019-11-24 02:04:36,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 02:04:36,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 02:04:36,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690145381] [2019-11-24 02:04:36,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 02:04:36,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:04:36,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 02:04:36,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 02:04:36,085 INFO L87 Difference]: Start difference. First operand 657 states and 1091 transitions. Second operand 4 states. [2019-11-24 02:04:36,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:04:36,280 INFO L93 Difference]: Finished difference Result 2284 states and 3777 transitions. [2019-11-24 02:04:36,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 02:04:36,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-24 02:04:36,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:04:36,292 INFO L225 Difference]: With dead ends: 2284 [2019-11-24 02:04:36,293 INFO L226 Difference]: Without dead ends: 1643 [2019-11-24 02:04:36,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 02:04:36,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2019-11-24 02:04:37,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1018. [2019-11-24 02:04:37,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2019-11-24 02:04:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1704 transitions. [2019-11-24 02:04:37,267 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1704 transitions. Word has length 28 [2019-11-24 02:04:37,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:04:37,267 INFO L462 AbstractCegarLoop]: Abstraction has 1018 states and 1704 transitions. [2019-11-24 02:04:37,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 02:04:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1704 transitions. [2019-11-24 02:04:37,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 02:04:37,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:04:37,272 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 02:04:37,273 INFO L410 AbstractCegarLoop]: === Iteration 3 === [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.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:04:37,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:04:37,275 INFO L82 PathProgramCache]: Analyzing trace with hash 474379198, now seen corresponding path program 1 times [2019-11-24 02:04:37,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:04:37,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720290937] [2019-11-24 02:04:37,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:04:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:04:37,391 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 02:04:37,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720290937] [2019-11-24 02:04:37,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 02:04:37,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 02:04:37,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862706645] [2019-11-24 02:04:37,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 02:04:37,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:04:37,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 02:04:37,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 02:04:37,394 INFO L87 Difference]: Start difference. First operand 1018 states and 1704 transitions. Second operand 4 states. [2019-11-24 02:04:37,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:04:37,604 INFO L93 Difference]: Finished difference Result 3022 states and 5019 transitions. [2019-11-24 02:04:37,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 02:04:37,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-24 02:04:37,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:04:37,616 INFO L225 Difference]: With dead ends: 3022 [2019-11-24 02:04:37,617 INFO L226 Difference]: Without dead ends: 2381 [2019-11-24 02:04:37,618 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 02:04:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2019-11-24 02:04:37,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 1575. [2019-11-24 02:04:37,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2019-11-24 02:04:37,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2645 transitions. [2019-11-24 02:04:37,687 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2645 transitions. Word has length 29 [2019-11-24 02:04:37,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:04:37,687 INFO L462 AbstractCegarLoop]: Abstraction has 1575 states and 2645 transitions. [2019-11-24 02:04:37,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 02:04:37,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2645 transitions. [2019-11-24 02:04:37,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-24 02:04:37,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:04:37,689 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] [2019-11-24 02:04:37,690 INFO L410 AbstractCegarLoop]: === Iteration 4 === [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.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:04:37,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:04:37,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1662954057, now seen corresponding path program 1 times [2019-11-24 02:04:37,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:04:37,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647975917] [2019-11-24 02:04:37,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:04:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:04:37,801 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 02:04:37,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647975917] [2019-11-24 02:04:37,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 02:04:37,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 02:04:37,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926019945] [2019-11-24 02:04:37,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 02:04:37,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:04:37,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 02:04:37,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 02:04:37,803 INFO L87 Difference]: Start difference. First operand 1575 states and 2645 transitions. Second operand 4 states. [2019-11-24 02:04:38,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:04:38,020 INFO L93 Difference]: Finished difference Result 3515 states and 5853 transitions. [2019-11-24 02:04:38,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 02:04:38,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-24 02:04:38,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:04:38,033 INFO L225 Difference]: With dead ends: 3515 [2019-11-24 02:04:38,033 INFO L226 Difference]: Without dead ends: 2317 [2019-11-24 02:04:38,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 02:04:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2019-11-24 02:04:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 1517. [2019-11-24 02:04:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1517 states. [2019-11-24 02:04:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 2543 transitions. [2019-11-24 02:04:38,103 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 2543 transitions. Word has length 30 [2019-11-24 02:04:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:04:38,103 INFO L462 AbstractCegarLoop]: Abstraction has 1517 states and 2543 transitions. [2019-11-24 02:04:38,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 02:04:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 2543 transitions. [2019-11-24 02:04:38,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 02:04:38,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:04:38,105 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 02:04:38,105 INFO L410 AbstractCegarLoop]: === Iteration 5 === [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.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:04:38,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:04:38,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1912835898, now seen corresponding path program 1 times [2019-11-24 02:04:38,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:04:38,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635765121] [2019-11-24 02:04:38,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:04:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:04:38,230 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 02:04:38,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635765121] [2019-11-24 02:04:38,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 02:04:38,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 02:04:38,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580242695] [2019-11-24 02:04:38,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 02:04:38,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:04:38,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 02:04:38,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 02:04:38,233 INFO L87 Difference]: Start difference. First operand 1517 states and 2543 transitions. Second operand 4 states. [2019-11-24 02:04:38,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:04:38,456 INFO L93 Difference]: Finished difference Result 5152 states and 8577 transitions. [2019-11-24 02:04:38,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 02:04:38,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-24 02:04:38,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:04:38,475 INFO L225 Difference]: With dead ends: 5152 [2019-11-24 02:04:38,476 INFO L226 Difference]: Without dead ends: 3651 [2019-11-24 02:04:38,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 02:04:38,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states. [2019-11-24 02:04:38,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 2238. [2019-11-24 02:04:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2238 states. [2019-11-24 02:04:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 3761 transitions. [2019-11-24 02:04:38,596 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 3761 transitions. Word has length 31 [2019-11-24 02:04:38,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:04:38,597 INFO L462 AbstractCegarLoop]: Abstraction has 2238 states and 3761 transitions. [2019-11-24 02:04:38,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 02:04:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 3761 transitions. [2019-11-24 02:04:38,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 02:04:38,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:04:38,599 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 02:04:38,599 INFO L410 AbstractCegarLoop]: === Iteration 6 === [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.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:04:38,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:04:38,600 INFO L82 PathProgramCache]: Analyzing trace with hash -99661256, now seen corresponding path program 1 times [2019-11-24 02:04:38,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:04:38,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014233614] [2019-11-24 02:04:38,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:04:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:04:38,729 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 02:04:38,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014233614] [2019-11-24 02:04:38,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 02:04:38,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 02:04:38,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343440245] [2019-11-24 02:04:38,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 02:04:38,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:04:38,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 02:04:38,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 02:04:38,732 INFO L87 Difference]: Start difference. First operand 2238 states and 3761 transitions. Second operand 4 states. [2019-11-24 02:04:39,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:04:39,078 INFO L93 Difference]: Finished difference Result 4924 states and 8218 transitions. [2019-11-24 02:04:39,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 02:04:39,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-24 02:04:39,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:04:39,104 INFO L225 Difference]: With dead ends: 4924 [2019-11-24 02:04:39,105 INFO L226 Difference]: Without dead ends: 3170 [2019-11-24 02:04:39,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 02:04:39,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2019-11-24 02:04:39,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 2122. [2019-11-24 02:04:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2019-11-24 02:04:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 3557 transitions. [2019-11-24 02:04:39,261 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 3557 transitions. Word has length 31 [2019-11-24 02:04:39,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:04:39,263 INFO L462 AbstractCegarLoop]: Abstraction has 2122 states and 3557 transitions. [2019-11-24 02:04:39,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 02:04:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3557 transitions. [2019-11-24 02:04:39,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 02:04:39,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:04:39,264 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 02:04:39,265 INFO L410 AbstractCegarLoop]: === Iteration 7 === [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.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:04:39,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:04:39,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1697393118, now seen corresponding path program 1 times [2019-11-24 02:04:39,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:04:39,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140354290] [2019-11-24 02:04:39,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:04:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:04:39,421 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 02:04:39,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140354290] [2019-11-24 02:04:39,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 02:04:39,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 02:04:39,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321720921] [2019-11-24 02:04:39,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 02:04:39,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:04:39,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 02:04:39,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 02:04:39,424 INFO L87 Difference]: Start difference. First operand 2122 states and 3557 transitions. Second operand 4 states. [2019-11-24 02:04:39,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:04:39,609 INFO L93 Difference]: Finished difference Result 4092 states and 6822 transitions. [2019-11-24 02:04:39,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 02:04:39,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-24 02:04:39,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:04:39,624 INFO L225 Difference]: With dead ends: 4092 [2019-11-24 02:04:39,624 INFO L226 Difference]: Without dead ends: 2649 [2019-11-24 02:04:39,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 02:04:39,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2019-11-24 02:04:39,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 1946. [2019-11-24 02:04:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2019-11-24 02:04:39,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 3250 transitions. [2019-11-24 02:04:39,728 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 3250 transitions. Word has length 32 [2019-11-24 02:04:39,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:04:39,729 INFO L462 AbstractCegarLoop]: Abstraction has 1946 states and 3250 transitions. [2019-11-24 02:04:39,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 02:04:39,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 3250 transitions. [2019-11-24 02:04:39,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-24 02:04:39,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:04:39,730 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 02:04:39,731 INFO L410 AbstractCegarLoop]: === Iteration 8 === [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.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:04:39,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:04:39,731 INFO L82 PathProgramCache]: Analyzing trace with hash -297077052, now seen corresponding path program 1 times [2019-11-24 02:04:39,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:04:39,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539296668] [2019-11-24 02:04:39,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:04:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:04:39,838 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 02:04:39,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539296668] [2019-11-24 02:04:39,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 02:04:39,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 02:04:39,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784086826] [2019-11-24 02:04:39,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 02:04:39,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:04:39,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 02:04:39,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 02:04:39,840 INFO L87 Difference]: Start difference. First operand 1946 states and 3250 transitions. Second operand 4 states. [2019-11-24 02:04:40,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:04:40,001 INFO L93 Difference]: Finished difference Result 3728 states and 6196 transitions. [2019-11-24 02:04:40,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 02:04:40,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-24 02:04:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:04:40,014 INFO L225 Difference]: With dead ends: 3728 [2019-11-24 02:04:40,014 INFO L226 Difference]: Without dead ends: 2461 [2019-11-24 02:04:40,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 02:04:40,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2019-11-24 02:04:40,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 1770. [2019-11-24 02:04:40,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1770 states. [2019-11-24 02:04:40,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 2943 transitions. [2019-11-24 02:04:40,119 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 2943 transitions. Word has length 33 [2019-11-24 02:04:40,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:04:40,120 INFO L462 AbstractCegarLoop]: Abstraction has 1770 states and 2943 transitions. [2019-11-24 02:04:40,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 02:04:40,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2943 transitions. [2019-11-24 02:04:40,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 02:04:40,121 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:04:40,121 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 02:04:40,121 INFO L410 AbstractCegarLoop]: === Iteration 9 === [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.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:04:40,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:04:40,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1116018905, now seen corresponding path program 1 times [2019-11-24 02:04:40,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:04:40,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258914455] [2019-11-24 02:04:40,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:04:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:04:40,225 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 02:04:40,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258914455] [2019-11-24 02:04:40,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 02:04:40,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 02:04:40,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923081070] [2019-11-24 02:04:40,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 02:04:40,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:04:40,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 02:04:40,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 02:04:40,229 INFO L87 Difference]: Start difference. First operand 1770 states and 2943 transitions. Second operand 4 states. [2019-11-24 02:04:40,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:04:40,404 INFO L93 Difference]: Finished difference Result 3364 states and 5570 transitions. [2019-11-24 02:04:40,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 02:04:40,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-24 02:04:40,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:04:40,416 INFO L225 Difference]: With dead ends: 3364 [2019-11-24 02:04:40,416 INFO L226 Difference]: Without dead ends: 2273 [2019-11-24 02:04:40,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 02:04:40,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2019-11-24 02:04:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 1594. [2019-11-24 02:04:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1594 states. [2019-11-24 02:04:40,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2636 transitions. [2019-11-24 02:04:40,515 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2636 transitions. Word has length 34 [2019-11-24 02:04:40,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:04:40,517 INFO L462 AbstractCegarLoop]: Abstraction has 1594 states and 2636 transitions. [2019-11-24 02:04:40,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 02:04:40,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2636 transitions. [2019-11-24 02:04:40,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 02:04:40,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:04:40,519 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] [2019-11-24 02:04:40,522 INFO L410 AbstractCegarLoop]: === Iteration 10 === [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.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:04:40,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:04:40,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1499208603, now seen corresponding path program 1 times [2019-11-24 02:04:40,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:04:40,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105935148] [2019-11-24 02:04:40,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:04:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:04:40,643 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 02:04:40,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105935148] [2019-11-24 02:04:40,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 02:04:40,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 02:04:40,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087080356] [2019-11-24 02:04:40,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 02:04:40,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:04:40,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 02:04:40,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 02:04:40,646 INFO L87 Difference]: Start difference. First operand 1594 states and 2636 transitions. Second operand 3 states. [2019-11-24 02:04:40,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:04:40,787 INFO L93 Difference]: Finished difference Result 1594 states and 2636 transitions. [2019-11-24 02:04:40,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 02:04:40,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-24 02:04:40,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:04:40,788 INFO L225 Difference]: With dead ends: 1594 [2019-11-24 02:04:40,788 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 02:04:40,790 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 02:04:40,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 02:04:40,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 02:04:40,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 02:04:40,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 02:04:40,791 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-11-24 02:04:40,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:04:40,792 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 02:04:40,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 02:04:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 02:04:40,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 02:04:40,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 02:04:41,304 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 67 [2019-11-24 02:04:43,571 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 10 [2019-11-24 02:04:43,712 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 10 [2019-11-24 02:04:44,225 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 10 [2019-11-24 02:04:45,181 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 10 [2019-11-24 02:04:45,423 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 10 [2019-11-24 02:04:45,530 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 10 [2019-11-24 02:04:45,980 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 10 [2019-11-24 02:04:46,757 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 10 [2019-11-24 02:04:46,910 INFO L440 ceAbstractionStarter]: At program point L4205(line 4205) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,910 INFO L440 ceAbstractionStarter]: At program point L3677-2(lines 3677 3695) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,910 INFO L444 ceAbstractionStarter]: For program point L3679(lines 3679 3683) no Hoare annotation was computed. [2019-11-24 02:04:46,911 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 2855) no Hoare annotation was computed. [2019-11-24 02:04:46,911 INFO L440 ceAbstractionStarter]: At program point L3153(lines 3112 3177) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,911 INFO L440 ceAbstractionStarter]: At program point L3419-1(lines 3419 3465) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,911 INFO L440 ceAbstractionStarter]: At program point L3419(lines 3419 3465) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,911 INFO L440 ceAbstractionStarter]: At program point L3419-3(lines 3419 3465) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,912 INFO L440 ceAbstractionStarter]: At program point L3419-2(lines 3419 3465) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,912 INFO L440 ceAbstractionStarter]: At program point L3419-5(lines 3419 3465) the Hoare annotation is: false [2019-11-24 02:04:46,912 INFO L440 ceAbstractionStarter]: At program point L3419-4(lines 3419 3465) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,912 INFO L440 ceAbstractionStarter]: At program point L3419-7(lines 3419 3465) the Hoare annotation is: false [2019-11-24 02:04:46,912 INFO L440 ceAbstractionStarter]: At program point L3419-6(lines 3419 3465) the Hoare annotation is: false [2019-11-24 02:04:46,913 INFO L444 ceAbstractionStarter]: For program point L4213(line 4213) no Hoare annotation was computed. [2019-11-24 02:04:46,913 INFO L444 ceAbstractionStarter]: For program point L3685-1(lines 3677 3695) no Hoare annotation was computed. [2019-11-24 02:04:46,913 INFO L440 ceAbstractionStarter]: At program point L3685(lines 3685 3695) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,913 INFO L444 ceAbstractionStarter]: For program point L3158(lines 3158 3161) no Hoare annotation was computed. [2019-11-24 02:04:46,913 INFO L444 ceAbstractionStarter]: For program point L3687(lines 3687 3691) no Hoare annotation was computed. [2019-11-24 02:04:46,913 INFO L440 ceAbstractionStarter]: At program point L3953-1(lines 3953 3986) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,913 INFO L444 ceAbstractionStarter]: For program point L3953(lines 3953 3986) no Hoare annotation was computed. [2019-11-24 02:04:46,914 INFO L440 ceAbstractionStarter]: At program point L3953-3(lines 3953 3986) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,914 INFO L444 ceAbstractionStarter]: For program point L3953-2(lines 3953 3986) no Hoare annotation was computed. [2019-11-24 02:04:46,914 INFO L440 ceAbstractionStarter]: At program point L3953-5(lines 3953 3986) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,914 INFO L444 ceAbstractionStarter]: For program point L3953-4(lines 3953 3986) no Hoare annotation was computed. [2019-11-24 02:04:46,914 INFO L440 ceAbstractionStarter]: At program point L3953-7(lines 3953 3986) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,914 INFO L444 ceAbstractionStarter]: For program point L3953-6(lines 3953 3986) no Hoare annotation was computed. [2019-11-24 02:04:46,914 INFO L444 ceAbstractionStarter]: For program point L4220(line 4220) no Hoare annotation was computed. [2019-11-24 02:04:46,914 INFO L444 ceAbstractionStarter]: For program point L3956(line 3956) no Hoare annotation was computed. [2019-11-24 02:04:46,915 INFO L444 ceAbstractionStarter]: For program point L3956-2(line 3956) no Hoare annotation was computed. [2019-11-24 02:04:46,915 INFO L444 ceAbstractionStarter]: For program point L3956-1(line 3956) no Hoare annotation was computed. [2019-11-24 02:04:46,915 INFO L444 ceAbstractionStarter]: For program point L3956-3(line 3956) no Hoare annotation was computed. [2019-11-24 02:04:46,915 INFO L444 ceAbstractionStarter]: For program point L4221(lines 4221 4224) no Hoare annotation was computed. [2019-11-24 02:04:46,915 INFO L440 ceAbstractionStarter]: At program point L3957-1(lines 3957 3972) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,915 INFO L440 ceAbstractionStarter]: At program point L3957(lines 3957 3972) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,915 INFO L440 ceAbstractionStarter]: At program point L3957-3(lines 3957 3972) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,916 INFO L440 ceAbstractionStarter]: At program point L3957-2(lines 3957 3972) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,916 INFO L440 ceAbstractionStarter]: At program point L3166(lines 3112 3177) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,916 INFO L440 ceAbstractionStarter]: At program point L3167-2(lines 3167 3170) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,916 INFO L440 ceAbstractionStarter]: At program point L3432(lines 3419 3464) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,916 INFO L440 ceAbstractionStarter]: At program point L3432-2(lines 3419 3464) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,916 INFO L440 ceAbstractionStarter]: At program point L3432-1(lines 3419 3464) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,917 INFO L440 ceAbstractionStarter]: At program point L3432-4(lines 3419 3464) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,917 INFO L440 ceAbstractionStarter]: At program point L3432-3(lines 3419 3464) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,917 INFO L440 ceAbstractionStarter]: At program point L3432-6(lines 3419 3464) the Hoare annotation is: false [2019-11-24 02:04:46,917 INFO L440 ceAbstractionStarter]: At program point L3432-5(lines 3419 3464) the Hoare annotation is: false [2019-11-24 02:04:46,917 INFO L440 ceAbstractionStarter]: At program point L3432-7(lines 3419 3464) the Hoare annotation is: false [2019-11-24 02:04:46,917 INFO L444 ceAbstractionStarter]: For program point L4226(line 4226) no Hoare annotation was computed. [2019-11-24 02:04:46,917 INFO L440 ceAbstractionStarter]: At program point L-1-2(line -1) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_1_1~0) (= 0 ~ldv_irq_1_3~0) (= 0 ~ldv_irq_2_0~0) (= ~ldv_state_variable_3~0 0) (= 0 ~ldv_irq_2_2~0) (= 0 ~ldv_irq_1_2~0) (= 0 ~ldv_irq_1_0~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,918 INFO L440 ceAbstractionStarter]: At program point L-1-5(line -1) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_1_1~0) (= 0 ~ldv_irq_1_3~0) (= 0 ~ldv_irq_2_0~0) (= ~ldv_state_variable_3~0 0) (= 0 ~ldv_irq_2_2~0) (= 0 ~ldv_irq_1_2~0) (= 0 ~ldv_irq_1_0~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,918 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2855) no Hoare annotation was computed. [2019-11-24 02:04:46,918 INFO L440 ceAbstractionStarter]: At program point L-1-8(line -1) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_1_1~0) (= 0 ~ldv_irq_1_3~0) (= 0 ~ldv_irq_2_0~0) (= ~ldv_state_variable_3~0 0) (= 0 ~ldv_irq_2_2~0) (= 0 ~ldv_irq_1_2~0) (= 0 ~ldv_irq_1_0~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,918 INFO L440 ceAbstractionStarter]: At program point L-1-11(line -1) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_1_1~0) (= 0 ~ldv_irq_1_3~0) (= 0 ~ldv_irq_2_0~0) (= ~ldv_state_variable_3~0 0) (= 0 ~ldv_irq_2_2~0) (= 0 ~ldv_irq_1_2~0) (= 0 ~ldv_irq_1_0~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,918 INFO L440 ceAbstractionStarter]: At program point L-1-14(line -1) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_1_1~0) (= 0 ~ldv_irq_1_3~0) (= 0 ~ldv_irq_2_0~0) (= ~ldv_state_variable_3~0 0) (= 0 ~ldv_irq_2_2~0) (= 0 ~ldv_irq_1_2~0) (= 0 ~ldv_irq_1_0~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,918 INFO L440 ceAbstractionStarter]: At program point L-1-17(line -1) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,918 INFO L440 ceAbstractionStarter]: At program point L-1-19(line -1) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,919 INFO L440 ceAbstractionStarter]: At program point L-1-22(line -1) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,919 INFO L440 ceAbstractionStarter]: At program point L-1-24(line -1) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,919 INFO L440 ceAbstractionStarter]: At program point L-1-27(line -1) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,919 INFO L440 ceAbstractionStarter]: At program point L-1-29(line -1) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,919 INFO L440 ceAbstractionStarter]: At program point L-1-32(line -1) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,919 INFO L440 ceAbstractionStarter]: At program point L-1-34(line -1) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,919 INFO L440 ceAbstractionStarter]: At program point L-1-37(line -1) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,920 INFO L440 ceAbstractionStarter]: At program point L-1-41(line -1) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,920 INFO L440 ceAbstractionStarter]: At program point L-1-43(line -1) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,920 INFO L440 ceAbstractionStarter]: At program point L-1-46(line -1) the Hoare annotation is: false [2019-11-24 02:04:46,920 INFO L440 ceAbstractionStarter]: At program point L-1-48(line -1) the Hoare annotation is: false [2019-11-24 02:04:46,920 INFO L440 ceAbstractionStarter]: At program point L-1-51(line -1) the Hoare annotation is: false [2019-11-24 02:04:46,920 INFO L440 ceAbstractionStarter]: At program point L-1-53(line -1) the Hoare annotation is: false [2019-11-24 02:04:46,920 INFO L440 ceAbstractionStarter]: At program point L-1-56(line -1) the Hoare annotation is: false [2019-11-24 02:04:46,920 INFO L440 ceAbstractionStarter]: At program point L-1-58(line -1) the Hoare annotation is: false [2019-11-24 02:04:46,921 INFO L440 ceAbstractionStarter]: At program point L4229(lines 4094 4234) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,921 INFO L440 ceAbstractionStarter]: At program point L3176(lines 3105 3178) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,921 INFO L440 ceAbstractionStarter]: At program point L3443-2(lines 3443 3452) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,921 INFO L440 ceAbstractionStarter]: At program point L3443-5(lines 3443 3452) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,921 INFO L440 ceAbstractionStarter]: At program point L3443-8(lines 3443 3452) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,921 INFO L440 ceAbstractionStarter]: At program point L3443-11(lines 3443 3452) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,921 INFO L440 ceAbstractionStarter]: At program point L3443-14(lines 3443 3452) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,922 INFO L440 ceAbstractionStarter]: At program point L3443-17(lines 3443 3452) the Hoare annotation is: false [2019-11-24 02:04:46,922 INFO L440 ceAbstractionStarter]: At program point L3443-20(lines 3443 3452) the Hoare annotation is: false [2019-11-24 02:04:46,922 INFO L440 ceAbstractionStarter]: At program point L3443-23(lines 3443 3452) the Hoare annotation is: false [2019-11-24 02:04:46,922 INFO L444 ceAbstractionStarter]: For program point L3974(line 3974) no Hoare annotation was computed. [2019-11-24 02:04:46,922 INFO L444 ceAbstractionStarter]: For program point L3974-2(line 3974) no Hoare annotation was computed. [2019-11-24 02:04:46,922 INFO L444 ceAbstractionStarter]: For program point L3974-1(line 3974) no Hoare annotation was computed. [2019-11-24 02:04:46,922 INFO L444 ceAbstractionStarter]: For program point L3974-3(line 3974) no Hoare annotation was computed. [2019-11-24 02:04:46,922 INFO L444 ceAbstractionStarter]: For program point L3975-1(lines 3975 3979) no Hoare annotation was computed. [2019-11-24 02:04:46,922 INFO L444 ceAbstractionStarter]: For program point L3975(lines 3975 3979) no Hoare annotation was computed. [2019-11-24 02:04:46,923 INFO L444 ceAbstractionStarter]: For program point L3975-3(lines 3975 3979) no Hoare annotation was computed. [2019-11-24 02:04:46,923 INFO L444 ceAbstractionStarter]: For program point L3975-2(lines 3975 3979) no Hoare annotation was computed. [2019-11-24 02:04:46,923 INFO L440 ceAbstractionStarter]: At program point L3713(lines 3615 3715) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,923 INFO L444 ceAbstractionStarter]: For program point L3981-1(line 3981) no Hoare annotation was computed. [2019-11-24 02:04:46,923 INFO L444 ceAbstractionStarter]: For program point L3981(line 3981) no Hoare annotation was computed. [2019-11-24 02:04:46,923 INFO L444 ceAbstractionStarter]: For program point L3981-3(line 3981) no Hoare annotation was computed. [2019-11-24 02:04:46,923 INFO L444 ceAbstractionStarter]: For program point L3981-2(line 3981) no Hoare annotation was computed. [2019-11-24 02:04:46,923 INFO L444 ceAbstractionStarter]: For program point L3456(lines 3456 3461) no Hoare annotation was computed. [2019-11-24 02:04:46,924 INFO L444 ceAbstractionStarter]: For program point L3456-2(lines 3456 3461) no Hoare annotation was computed. [2019-11-24 02:04:46,924 INFO L444 ceAbstractionStarter]: For program point L3456-1(lines 3456 3461) no Hoare annotation was computed. [2019-11-24 02:04:46,924 INFO L444 ceAbstractionStarter]: For program point L3456-4(lines 3456 3461) no Hoare annotation was computed. [2019-11-24 02:04:46,924 INFO L444 ceAbstractionStarter]: For program point L3456-3(lines 3456 3461) no Hoare annotation was computed. [2019-11-24 02:04:46,924 INFO L444 ceAbstractionStarter]: For program point L3456-6(lines 3456 3461) no Hoare annotation was computed. [2019-11-24 02:04:46,924 INFO L444 ceAbstractionStarter]: For program point L3456-5(lines 3456 3461) no Hoare annotation was computed. [2019-11-24 02:04:46,924 INFO L444 ceAbstractionStarter]: For program point L3456-7(lines 3456 3461) no Hoare annotation was computed. [2019-11-24 02:04:46,924 INFO L440 ceAbstractionStarter]: At program point L3987-1(lines 3947 3989) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,925 INFO L440 ceAbstractionStarter]: At program point L3987(lines 3947 3989) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,925 INFO L440 ceAbstractionStarter]: At program point L3987-3(lines 3947 3989) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,925 INFO L440 ceAbstractionStarter]: At program point L3987-2(lines 3947 3989) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,925 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 2855) no Hoare annotation was computed. [2019-11-24 02:04:46,925 INFO L440 ceAbstractionStarter]: At program point L4523-1(lines 3438 3442) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,925 INFO L440 ceAbstractionStarter]: At program point L3466(lines 3406 3468) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,925 INFO L440 ceAbstractionStarter]: At program point L3466-2(lines 3406 3468) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,926 INFO L440 ceAbstractionStarter]: At program point L4523-4(lines 3438 3442) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,926 INFO L440 ceAbstractionStarter]: At program point L3466-1(lines 3406 3468) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,926 INFO L440 ceAbstractionStarter]: At program point L4523-5(lines 3438 3442) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,926 INFO L440 ceAbstractionStarter]: At program point L4523-2(lines 3438 3442) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,926 INFO L440 ceAbstractionStarter]: At program point L3466-4(lines 3406 3468) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,926 INFO L440 ceAbstractionStarter]: At program point L4523-3(lines 3438 3442) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,927 INFO L440 ceAbstractionStarter]: At program point L3466-3(lines 3406 3468) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,927 INFO L440 ceAbstractionStarter]: At program point L3466-6(lines 3406 3468) the Hoare annotation is: false [2019-11-24 02:04:46,927 INFO L440 ceAbstractionStarter]: At program point L4523-8(lines 3438 3442) the Hoare annotation is: false [2019-11-24 02:04:46,927 INFO L440 ceAbstractionStarter]: At program point L3466-5(lines 3406 3468) the Hoare annotation is: false [2019-11-24 02:04:46,927 INFO L440 ceAbstractionStarter]: At program point L4523-6(lines 3438 3442) the Hoare annotation is: false [2019-11-24 02:04:46,927 INFO L440 ceAbstractionStarter]: At program point L4523-7(lines 3438 3442) the Hoare annotation is: false [2019-11-24 02:04:46,927 INFO L440 ceAbstractionStarter]: At program point L3466-7(lines 3406 3468) the Hoare annotation is: false [2019-11-24 02:04:46,927 INFO L444 ceAbstractionStarter]: For program point L3996(lines 3996 4029) no Hoare annotation was computed. [2019-11-24 02:04:46,927 INFO L444 ceAbstractionStarter]: For program point L3996-2(lines 3996 4029) no Hoare annotation was computed. [2019-11-24 02:04:46,928 INFO L440 ceAbstractionStarter]: At program point L3996-1(lines 3996 4029) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,928 INFO L444 ceAbstractionStarter]: For program point L3996-4(lines 3996 4029) no Hoare annotation was computed. [2019-11-24 02:04:46,928 INFO L440 ceAbstractionStarter]: At program point L3996-3(lines 3996 4029) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= 0 ULTIMATE.start_ldv_irq_2_~state) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,928 INFO L444 ceAbstractionStarter]: For program point L3996-6(lines 3996 4029) no Hoare annotation was computed. [2019-11-24 02:04:46,928 INFO L440 ceAbstractionStarter]: At program point L3996-5(lines 3996 4029) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= 0 ULTIMATE.start_ldv_irq_2_~state) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,928 INFO L440 ceAbstractionStarter]: At program point L3996-7(lines 3996 4029) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= 0 ULTIMATE.start_ldv_irq_2_~state) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,928 INFO L444 ceAbstractionStarter]: For program point L3999-1(line 3999) no Hoare annotation was computed. [2019-11-24 02:04:46,928 INFO L444 ceAbstractionStarter]: For program point L3999(line 3999) no Hoare annotation was computed. [2019-11-24 02:04:46,929 INFO L444 ceAbstractionStarter]: For program point L3999-3(line 3999) no Hoare annotation was computed. [2019-11-24 02:04:46,929 INFO L444 ceAbstractionStarter]: For program point L3999-2(line 3999) no Hoare annotation was computed. [2019-11-24 02:04:46,929 INFO L440 ceAbstractionStarter]: At program point L4000(lines 4000 4015) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,929 INFO L440 ceAbstractionStarter]: At program point L4000-2(lines 4000 4015) the Hoare annotation is: false [2019-11-24 02:04:46,929 INFO L440 ceAbstractionStarter]: At program point L4000-1(lines 4000 4015) the Hoare annotation is: false [2019-11-24 02:04:46,929 INFO L440 ceAbstractionStarter]: At program point L4000-3(lines 4000 4015) the Hoare annotation is: false [2019-11-24 02:04:46,929 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 2855) no Hoare annotation was computed. [2019-11-24 02:04:46,930 INFO L440 ceAbstractionStarter]: At program point L3484-2(lines 3484 3505) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,930 INFO L440 ceAbstractionStarter]: At program point L3484-5(lines 3484 3505) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,930 INFO L440 ceAbstractionStarter]: At program point L3484-8(lines 3484 3505) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,930 INFO L440 ceAbstractionStarter]: At program point L3484-11(lines 3484 3505) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,930 INFO L440 ceAbstractionStarter]: At program point L3484-14(lines 3484 3505) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,930 INFO L440 ceAbstractionStarter]: At program point L3484-17(lines 3484 3505) the Hoare annotation is: false [2019-11-24 02:04:46,930 INFO L440 ceAbstractionStarter]: At program point L3484-20(lines 3484 3505) the Hoare annotation is: false [2019-11-24 02:04:46,930 INFO L440 ceAbstractionStarter]: At program point L3484-23(lines 3484 3505) the Hoare annotation is: false [2019-11-24 02:04:46,931 INFO L444 ceAbstractionStarter]: For program point L4017-1(line 4017) no Hoare annotation was computed. [2019-11-24 02:04:46,931 INFO L444 ceAbstractionStarter]: For program point L4017(line 4017) no Hoare annotation was computed. [2019-11-24 02:04:46,931 INFO L444 ceAbstractionStarter]: For program point L4017-3(line 4017) no Hoare annotation was computed. [2019-11-24 02:04:46,931 INFO L444 ceAbstractionStarter]: For program point L4017-2(line 4017) no Hoare annotation was computed. [2019-11-24 02:04:46,931 INFO L444 ceAbstractionStarter]: For program point L4018(lines 4018 4022) no Hoare annotation was computed. [2019-11-24 02:04:46,931 INFO L444 ceAbstractionStarter]: For program point L4018-2(lines 4018 4022) no Hoare annotation was computed. [2019-11-24 02:04:46,931 INFO L444 ceAbstractionStarter]: For program point L4018-1(lines 4018 4022) no Hoare annotation was computed. [2019-11-24 02:04:46,931 INFO L444 ceAbstractionStarter]: For program point L4018-3(lines 4018 4022) no Hoare annotation was computed. [2019-11-24 02:04:46,931 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 02:04:46,931 INFO L444 ceAbstractionStarter]: For program point L4024(line 4024) no Hoare annotation was computed. [2019-11-24 02:04:46,932 INFO L444 ceAbstractionStarter]: For program point L4024-2(line 4024) no Hoare annotation was computed. [2019-11-24 02:04:46,932 INFO L444 ceAbstractionStarter]: For program point L4024-1(line 4024) no Hoare annotation was computed. [2019-11-24 02:04:46,932 INFO L444 ceAbstractionStarter]: For program point L4024-3(line 4024) no Hoare annotation was computed. [2019-11-24 02:04:46,932 INFO L440 ceAbstractionStarter]: At program point L4030(lines 3990 4032) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,932 INFO L440 ceAbstractionStarter]: At program point L4030-2(lines 3990 4032) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= 0 ULTIMATE.start_ldv_irq_2_~state) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,932 INFO L440 ceAbstractionStarter]: At program point L4030-1(lines 3990 4032) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= 0 ULTIMATE.start_ldv_irq_2_~state) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,932 INFO L440 ceAbstractionStarter]: At program point L4030-3(lines 3990 4032) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= 0 ULTIMATE.start_ldv_irq_2_~state) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,932 INFO L444 ceAbstractionStarter]: For program point L4039(line 4039) no Hoare annotation was computed. [2019-11-24 02:04:46,933 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 2855) no Hoare annotation was computed. [2019-11-24 02:04:46,933 INFO L444 ceAbstractionStarter]: For program point L4042(line 4042) no Hoare annotation was computed. [2019-11-24 02:04:46,933 INFO L444 ceAbstractionStarter]: For program point L4045(line 4045) no Hoare annotation was computed. [2019-11-24 02:04:46,933 INFO L444 ceAbstractionStarter]: For program point L3518(lines 3518 3521) no Hoare annotation was computed. [2019-11-24 02:04:46,933 INFO L444 ceAbstractionStarter]: For program point L3518-2(lines 3518 3521) no Hoare annotation was computed. [2019-11-24 02:04:46,933 INFO L444 ceAbstractionStarter]: For program point L3518-1(lines 3518 3521) no Hoare annotation was computed. [2019-11-24 02:04:46,933 INFO L444 ceAbstractionStarter]: For program point L3518-4(lines 3518 3521) no Hoare annotation was computed. [2019-11-24 02:04:46,933 INFO L444 ceAbstractionStarter]: For program point L3518-3(lines 3518 3521) no Hoare annotation was computed. [2019-11-24 02:04:46,933 INFO L444 ceAbstractionStarter]: For program point L3518-6(lines 3518 3521) no Hoare annotation was computed. [2019-11-24 02:04:46,934 INFO L444 ceAbstractionStarter]: For program point L3518-5(lines 3518 3521) no Hoare annotation was computed. [2019-11-24 02:04:46,934 INFO L444 ceAbstractionStarter]: For program point L3518-7(lines 3518 3521) no Hoare annotation was computed. [2019-11-24 02:04:46,934 INFO L444 ceAbstractionStarter]: For program point L4048(line 4048) no Hoare annotation was computed. [2019-11-24 02:04:46,934 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-24 02:04:46,934 INFO L444 ceAbstractionStarter]: For program point L4051(line 4051) no Hoare annotation was computed. [2019-11-24 02:04:46,934 INFO L440 ceAbstractionStarter]: At program point L3523-1(lines 3523 3541) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,934 INFO L440 ceAbstractionStarter]: At program point L3523(lines 3523 3541) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,934 INFO L440 ceAbstractionStarter]: At program point L3523-3(lines 3523 3541) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,935 INFO L440 ceAbstractionStarter]: At program point L3523-2(lines 3523 3541) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,935 INFO L440 ceAbstractionStarter]: At program point L3523-5(lines 3523 3541) the Hoare annotation is: false [2019-11-24 02:04:46,935 INFO L440 ceAbstractionStarter]: At program point L3523-4(lines 3523 3541) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,935 INFO L440 ceAbstractionStarter]: At program point L3523-7(lines 3523 3541) the Hoare annotation is: false [2019-11-24 02:04:46,935 INFO L440 ceAbstractionStarter]: At program point L3523-6(lines 3523 3541) the Hoare annotation is: false [2019-11-24 02:04:46,935 INFO L440 ceAbstractionStarter]: At program point L3260(lines 3260 3263) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,935 INFO L444 ceAbstractionStarter]: For program point L3789(line 3789) no Hoare annotation was computed. [2019-11-24 02:04:46,935 INFO L444 ceAbstractionStarter]: For program point L3792(line 3792) no Hoare annotation was computed. [2019-11-24 02:04:46,935 INFO L440 ceAbstractionStarter]: At program point L3528(lines 3528 3541) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,936 INFO L440 ceAbstractionStarter]: At program point L3528-2(lines 3528 3541) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,936 INFO L440 ceAbstractionStarter]: At program point L3528-1(lines 3528 3541) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,936 INFO L440 ceAbstractionStarter]: At program point L3528-4(lines 3528 3541) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,936 INFO L440 ceAbstractionStarter]: At program point L3528-3(lines 3528 3541) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,936 INFO L440 ceAbstractionStarter]: At program point L3528-6(lines 3528 3541) the Hoare annotation is: false [2019-11-24 02:04:46,936 INFO L440 ceAbstractionStarter]: At program point L3528-5(lines 3528 3541) the Hoare annotation is: false [2019-11-24 02:04:46,936 INFO L440 ceAbstractionStarter]: At program point L3528-7(lines 3528 3541) the Hoare annotation is: false [2019-11-24 02:04:46,936 INFO L444 ceAbstractionStarter]: For program point L3795(line 3795) no Hoare annotation was computed. [2019-11-24 02:04:46,937 INFO L444 ceAbstractionStarter]: For program point L3798(line 3798) no Hoare annotation was computed. [2019-11-24 02:04:46,937 INFO L444 ceAbstractionStarter]: For program point L3801(line 3801) no Hoare annotation was computed. [2019-11-24 02:04:46,937 INFO L440 ceAbstractionStarter]: At program point L3283(lines 3243 3317) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,937 INFO L440 ceAbstractionStarter]: At program point L3548(lines 3469 3550) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,937 INFO L440 ceAbstractionStarter]: At program point L3548-2(lines 3469 3550) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,937 INFO L440 ceAbstractionStarter]: At program point L3548-1(lines 3469 3550) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,937 INFO L440 ceAbstractionStarter]: At program point L3548-4(lines 3469 3550) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,937 INFO L440 ceAbstractionStarter]: At program point L3548-3(lines 3469 3550) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,938 INFO L440 ceAbstractionStarter]: At program point L3548-6(lines 3469 3550) the Hoare annotation is: false [2019-11-24 02:04:46,938 INFO L440 ceAbstractionStarter]: At program point L3548-5(lines 3469 3550) the Hoare annotation is: false [2019-11-24 02:04:46,938 INFO L440 ceAbstractionStarter]: At program point L3284(lines 3284 3287) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,938 INFO L440 ceAbstractionStarter]: At program point L3548-7(lines 3469 3550) the Hoare annotation is: false [2019-11-24 02:04:46,938 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 2855) no Hoare annotation was computed. [2019-11-24 02:04:46,938 INFO L440 ceAbstractionStarter]: At program point L3301(lines 3243 3317) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,939 INFO L440 ceAbstractionStarter]: At program point L3569(lines 3569 3573) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,939 INFO L444 ceAbstractionStarter]: For program point L4370(lines 4370 4373) no Hoare annotation was computed. [2019-11-24 02:04:46,939 INFO L444 ceAbstractionStarter]: For program point L4370-4(lines 4370 4373) no Hoare annotation was computed. [2019-11-24 02:04:46,939 INFO L444 ceAbstractionStarter]: For program point L4370-2(lines 4370 4373) no Hoare annotation was computed. [2019-11-24 02:04:46,939 INFO L444 ceAbstractionStarter]: For program point L4370-8(lines 4370 4373) no Hoare annotation was computed. [2019-11-24 02:04:46,939 INFO L444 ceAbstractionStarter]: For program point L4370-6(lines 4370 4373) no Hoare annotation was computed. [2019-11-24 02:04:46,939 INFO L444 ceAbstractionStarter]: For program point L4370-12(lines 4370 4373) no Hoare annotation was computed. [2019-11-24 02:04:46,939 INFO L444 ceAbstractionStarter]: For program point L4370-10(lines 4370 4373) no Hoare annotation was computed. [2019-11-24 02:04:46,939 INFO L444 ceAbstractionStarter]: For program point L4370-16(lines 4370 4373) no Hoare annotation was computed. [2019-11-24 02:04:46,940 INFO L444 ceAbstractionStarter]: For program point L4370-14(lines 4370 4373) no Hoare annotation was computed. [2019-11-24 02:04:46,940 INFO L440 ceAbstractionStarter]: At program point L3578(lines 3578 3582) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,940 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 2855) no Hoare annotation was computed. [2019-11-24 02:04:46,940 INFO L440 ceAbstractionStarter]: At program point L3316(lines 3231 3318) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,940 INFO L444 ceAbstractionStarter]: For program point L3584(lines 3584 3588) no Hoare annotation was computed. [2019-11-24 02:04:46,940 INFO L444 ceAbstractionStarter]: For program point L4115(line 4115) no Hoare annotation was computed. [2019-11-24 02:04:46,940 INFO L444 ceAbstractionStarter]: For program point L4116(lines 4116 4145) no Hoare annotation was computed. [2019-11-24 02:04:46,940 INFO L444 ceAbstractionStarter]: For program point L3324(lines 3324 3327) no Hoare annotation was computed. [2019-11-24 02:04:46,941 INFO L444 ceAbstractionStarter]: For program point L3324-2(lines 3324 3327) no Hoare annotation was computed. [2019-11-24 02:04:46,941 INFO L444 ceAbstractionStarter]: For program point L3324-1(lines 3324 3327) no Hoare annotation was computed. [2019-11-24 02:04:46,941 INFO L444 ceAbstractionStarter]: For program point L3324-4(lines 3324 3327) no Hoare annotation was computed. [2019-11-24 02:04:46,941 INFO L444 ceAbstractionStarter]: For program point L3324-3(lines 3324 3327) no Hoare annotation was computed. [2019-11-24 02:04:46,941 INFO L444 ceAbstractionStarter]: For program point L3324-6(lines 3324 3327) no Hoare annotation was computed. [2019-11-24 02:04:46,941 INFO L444 ceAbstractionStarter]: For program point L3324-5(lines 3324 3327) no Hoare annotation was computed. [2019-11-24 02:04:46,941 INFO L444 ceAbstractionStarter]: For program point L3324-7(lines 3324 3327) no Hoare annotation was computed. [2019-11-24 02:04:46,941 INFO L440 ceAbstractionStarter]: At program point L3589(lines 3589 3603) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,941 INFO L440 ceAbstractionStarter]: At program point L3589-2(lines 3589 3603) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,942 INFO L440 ceAbstractionStarter]: At program point L4119(line 4119) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,942 INFO L440 ceAbstractionStarter]: At program point L3591(lines 3591 3595) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,942 INFO L440 ceAbstractionStarter]: At program point L3332(lines 3322 3338) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,942 INFO L440 ceAbstractionStarter]: At program point L3332-2(lines 3322 3338) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,942 INFO L440 ceAbstractionStarter]: At program point L3332-1(lines 3322 3338) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,942 INFO L440 ceAbstractionStarter]: At program point L3332-4(lines 3322 3338) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,942 INFO L440 ceAbstractionStarter]: At program point L3332-3(lines 3322 3338) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,943 INFO L440 ceAbstractionStarter]: At program point L3332-6(lines 3322 3338) the Hoare annotation is: false [2019-11-24 02:04:46,943 INFO L440 ceAbstractionStarter]: At program point L3332-5(lines 3322 3338) the Hoare annotation is: false [2019-11-24 02:04:46,943 INFO L440 ceAbstractionStarter]: At program point L3332-7(lines 3322 3338) the Hoare annotation is: false [2019-11-24 02:04:46,943 INFO L444 ceAbstractionStarter]: For program point L3597(lines 3597 3601) no Hoare annotation was computed. [2019-11-24 02:04:46,943 INFO L440 ceAbstractionStarter]: At program point L3333-2(lines 3333 3336) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,943 INFO L440 ceAbstractionStarter]: At program point L3333-5(lines 3333 3336) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,943 INFO L444 ceAbstractionStarter]: For program point L4126(line 4126) no Hoare annotation was computed. [2019-11-24 02:04:46,943 INFO L440 ceAbstractionStarter]: At program point L3333-8(lines 3333 3336) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,944 INFO L440 ceAbstractionStarter]: At program point L3333-11(lines 3333 3336) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,944 INFO L440 ceAbstractionStarter]: At program point L3333-14(lines 3333 3336) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,944 INFO L440 ceAbstractionStarter]: At program point L3333-17(lines 3333 3336) the Hoare annotation is: false [2019-11-24 02:04:46,944 INFO L440 ceAbstractionStarter]: At program point L3333-20(lines 3333 3336) the Hoare annotation is: false [2019-11-24 02:04:46,944 INFO L440 ceAbstractionStarter]: At program point L3333-23(lines 3333 3336) the Hoare annotation is: false [2019-11-24 02:04:46,944 INFO L440 ceAbstractionStarter]: At program point L4127(lines 4127 4131) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,944 INFO L440 ceAbstractionStarter]: At program point L3337-1(lines 3319 3339) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,945 INFO L440 ceAbstractionStarter]: At program point L3337(lines 3319 3339) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,945 INFO L440 ceAbstractionStarter]: At program point L3337-3(lines 3319 3339) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,945 INFO L440 ceAbstractionStarter]: At program point L3337-2(lines 3319 3339) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,945 INFO L440 ceAbstractionStarter]: At program point L3337-5(lines 3319 3339) the Hoare annotation is: false [2019-11-24 02:04:46,945 INFO L440 ceAbstractionStarter]: At program point L3337-4(lines 3319 3339) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,945 INFO L440 ceAbstractionStarter]: At program point L3337-7(lines 3319 3339) the Hoare annotation is: false [2019-11-24 02:04:46,945 INFO L440 ceAbstractionStarter]: At program point L3337-6(lines 3319 3339) the Hoare annotation is: false [2019-11-24 02:04:46,945 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 2855) no Hoare annotation was computed. [2019-11-24 02:04:46,946 INFO L440 ceAbstractionStarter]: At program point L4133(line 4133) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,946 INFO L444 ceAbstractionStarter]: For program point L4140(line 4140) no Hoare annotation was computed. [2019-11-24 02:04:46,946 INFO L440 ceAbstractionStarter]: At program point L3612(lines 3558 3614) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,946 INFO L444 ceAbstractionStarter]: For program point L2825-1(lines 2825 2832) no Hoare annotation was computed. [2019-11-24 02:04:46,946 INFO L444 ceAbstractionStarter]: For program point L2825(lines 2825 2832) no Hoare annotation was computed. [2019-11-24 02:04:46,946 INFO L444 ceAbstractionStarter]: For program point L2825-3(lines 2825 2832) no Hoare annotation was computed. [2019-11-24 02:04:46,946 INFO L444 ceAbstractionStarter]: For program point L2825-2(lines 2825 2832) no Hoare annotation was computed. [2019-11-24 02:04:46,947 INFO L444 ceAbstractionStarter]: For program point L2825-5(lines 2825 2832) no Hoare annotation was computed. [2019-11-24 02:04:46,947 INFO L444 ceAbstractionStarter]: For program point L2825-4(lines 2825 2832) no Hoare annotation was computed. [2019-11-24 02:04:46,947 INFO L444 ceAbstractionStarter]: For program point L4147(line 4147) no Hoare annotation was computed. [2019-11-24 02:04:46,947 INFO L444 ceAbstractionStarter]: For program point L4148(lines 4148 4151) no Hoare annotation was computed. [2019-11-24 02:04:46,947 INFO L440 ceAbstractionStarter]: At program point L2831-1(lines 2818 2834) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_1_1~0) (= 0 ~ldv_irq_1_3~0) (= 0 ~ldv_irq_2_0~0) (= ~ldv_state_variable_3~0 0) (= 0 ~ldv_irq_2_2~0) (= 0 ~ldv_irq_1_2~0) (= 0 ~ldv_irq_1_0~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,947 INFO L440 ceAbstractionStarter]: At program point L2831(lines 2818 2834) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_1_1~0) (= 0 ~ldv_irq_1_3~0) (= 0 ~ldv_irq_2_0~0) (= ~ldv_state_variable_3~0 0) (= 0 ~ldv_irq_2_2~0) (= 0 ~ldv_irq_1_2~0) (= 0 ~ldv_irq_1_0~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,947 INFO L440 ceAbstractionStarter]: At program point L2831-3(lines 2818 2834) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_1_1~0) (= 0 ~ldv_irq_1_3~0) (= 0 ~ldv_irq_2_0~0) (= ~ldv_state_variable_3~0 0) (= 0 ~ldv_irq_2_2~0) (= 0 ~ldv_irq_1_2~0) (= 0 ~ldv_irq_1_0~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,948 INFO L440 ceAbstractionStarter]: At program point L2831-2(lines 2818 2834) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_1_1~0) (= 0 ~ldv_irq_1_3~0) (= 0 ~ldv_irq_2_0~0) (= ~ldv_state_variable_3~0 0) (= 0 ~ldv_irq_2_2~0) (= 0 ~ldv_irq_1_2~0) (= 0 ~ldv_irq_1_0~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,948 INFO L440 ceAbstractionStarter]: At program point L2831-5(lines 2818 2834) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,948 INFO L440 ceAbstractionStarter]: At program point L2831-4(lines 2818 2834) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_1_1~0) (= 0 ~ldv_irq_1_3~0) (= 0 ~ldv_irq_2_0~0) (= ~ldv_state_variable_3~0 0) (= 0 ~ldv_irq_2_2~0) (= 0 ~ldv_irq_1_2~0) (= 0 ~ldv_irq_1_0~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,948 INFO L444 ceAbstractionStarter]: For program point L4153(line 4153) no Hoare annotation was computed. [2019-11-24 02:04:46,948 INFO L444 ceAbstractionStarter]: For program point L4154(lines 4154 4188) no Hoare annotation was computed. [2019-11-24 02:04:46,948 INFO L444 ceAbstractionStarter]: For program point L4157(line 4157) no Hoare annotation was computed. [2019-11-24 02:04:46,948 INFO L444 ceAbstractionStarter]: For program point L3365-5(lines 3365 3368) no Hoare annotation was computed. [2019-11-24 02:04:46,949 INFO L440 ceAbstractionStarter]: At program point L4158(lines 4158 4163) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,949 INFO L444 ceAbstractionStarter]: For program point L3365-11(lines 3365 3368) no Hoare annotation was computed. [2019-11-24 02:04:46,949 INFO L444 ceAbstractionStarter]: For program point L3365-17(lines 3365 3368) no Hoare annotation was computed. [2019-11-24 02:04:46,949 INFO L444 ceAbstractionStarter]: For program point L3365-23(lines 3365 3368) no Hoare annotation was computed. [2019-11-24 02:04:46,949 INFO L444 ceAbstractionStarter]: For program point L3365-29(lines 3365 3368) no Hoare annotation was computed. [2019-11-24 02:04:46,949 INFO L444 ceAbstractionStarter]: For program point L3365-35(lines 3365 3368) no Hoare annotation was computed. [2019-11-24 02:04:46,949 INFO L444 ceAbstractionStarter]: For program point L3365-41(lines 3365 3368) no Hoare annotation was computed. [2019-11-24 02:04:46,949 INFO L444 ceAbstractionStarter]: For program point L3365-47(lines 3365 3368) no Hoare annotation was computed. [2019-11-24 02:04:46,950 INFO L440 ceAbstractionStarter]: At program point L3370(lines 3370 3401) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,950 INFO L440 ceAbstractionStarter]: At program point L3370-2(lines 3370 3401) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,950 INFO L440 ceAbstractionStarter]: At program point L3370-1(lines 3370 3401) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,950 INFO L440 ceAbstractionStarter]: At program point L3370-4(lines 3370 3401) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,950 INFO L440 ceAbstractionStarter]: At program point L3370-3(lines 3370 3401) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,950 INFO L440 ceAbstractionStarter]: At program point L3370-6(lines 3370 3401) the Hoare annotation is: false [2019-11-24 02:04:46,950 INFO L440 ceAbstractionStarter]: At program point L3370-5(lines 3370 3401) the Hoare annotation is: false [2019-11-24 02:04:46,951 INFO L440 ceAbstractionStarter]: At program point L3370-7(lines 3370 3401) the Hoare annotation is: false [2019-11-24 02:04:46,951 INFO L444 ceAbstractionStarter]: For program point L4165(line 4165) no Hoare annotation was computed. [2019-11-24 02:04:46,951 INFO L440 ceAbstractionStarter]: At program point L4166(lines 4166 4181) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,951 INFO L444 ceAbstractionStarter]: For program point L4168(lines 4168 4174) no Hoare annotation was computed. [2019-11-24 02:04:46,951 INFO L444 ceAbstractionStarter]: For program point L4168-2(lines 4166 4180) no Hoare annotation was computed. [2019-11-24 02:04:46,951 INFO L440 ceAbstractionStarter]: At program point L2851-1(lines 4367 4376) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,951 INFO L440 ceAbstractionStarter]: At program point L2851(lines 4367 4376) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,951 INFO L440 ceAbstractionStarter]: At program point L2851-3(lines 4367 4376) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,952 INFO L440 ceAbstractionStarter]: At program point L2851-2(lines 4367 4376) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,952 INFO L440 ceAbstractionStarter]: At program point L2851-5(lines 4367 4376) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,952 INFO L440 ceAbstractionStarter]: At program point L2851-4(lines 4367 4376) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,952 INFO L440 ceAbstractionStarter]: At program point L2851-7(lines 4367 4376) the Hoare annotation is: false [2019-11-24 02:04:46,952 INFO L440 ceAbstractionStarter]: At program point L2851-6(lines 4367 4376) the Hoare annotation is: false [2019-11-24 02:04:46,952 INFO L440 ceAbstractionStarter]: At program point L2851-8(lines 4367 4376) the Hoare annotation is: false [2019-11-24 02:04:46,952 INFO L444 ceAbstractionStarter]: For program point L2854(line 2854) no Hoare annotation was computed. [2019-11-24 02:04:46,952 INFO L444 ceAbstractionStarter]: For program point L2854-2(line 2854) no Hoare annotation was computed. [2019-11-24 02:04:46,952 INFO L444 ceAbstractionStarter]: For program point L2854-1(line 2854) no Hoare annotation was computed. [2019-11-24 02:04:46,952 INFO L444 ceAbstractionStarter]: For program point L2854-4(line 2854) no Hoare annotation was computed. [2019-11-24 02:04:46,953 INFO L444 ceAbstractionStarter]: For program point L2854-3(line 2854) no Hoare annotation was computed. [2019-11-24 02:04:46,953 INFO L444 ceAbstractionStarter]: For program point L2854-6(line 2854) no Hoare annotation was computed. [2019-11-24 02:04:46,953 INFO L444 ceAbstractionStarter]: For program point L2854-5(line 2854) no Hoare annotation was computed. [2019-11-24 02:04:46,953 INFO L444 ceAbstractionStarter]: For program point L2854-8(line 2854) no Hoare annotation was computed. [2019-11-24 02:04:46,953 INFO L444 ceAbstractionStarter]: For program point L2854-7(line 2854) no Hoare annotation was computed. [2019-11-24 02:04:46,953 INFO L440 ceAbstractionStarter]: At program point L3384(lines 3370 3400) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,953 INFO L440 ceAbstractionStarter]: At program point L3384-2(lines 3370 3400) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,953 INFO L440 ceAbstractionStarter]: At program point L3384-1(lines 3370 3400) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,953 INFO L440 ceAbstractionStarter]: At program point L3384-4(lines 3370 3400) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,954 INFO L440 ceAbstractionStarter]: At program point L3384-3(lines 3370 3400) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,954 INFO L440 ceAbstractionStarter]: At program point L3384-6(lines 3370 3400) the Hoare annotation is: false [2019-11-24 02:04:46,954 INFO L440 ceAbstractionStarter]: At program point L3384-5(lines 3370 3400) the Hoare annotation is: false [2019-11-24 02:04:46,954 INFO L447 ceAbstractionStarter]: At program point L4177(lines 1 4575) the Hoare annotation is: true [2019-11-24 02:04:46,954 INFO L440 ceAbstractionStarter]: At program point L3384-7(lines 3370 3400) the Hoare annotation is: false [2019-11-24 02:04:46,954 INFO L440 ceAbstractionStarter]: At program point L3385-1(lines 3385 3388) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,954 INFO L440 ceAbstractionStarter]: At program point L3385(lines 3385 3388) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,954 INFO L440 ceAbstractionStarter]: At program point L3385-3(lines 3385 3388) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,955 INFO L440 ceAbstractionStarter]: At program point L3385-2(lines 3385 3388) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,955 INFO L440 ceAbstractionStarter]: At program point L3385-5(lines 3385 3388) the Hoare annotation is: false [2019-11-24 02:04:46,955 INFO L440 ceAbstractionStarter]: At program point L3385-4(lines 3385 3388) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,955 INFO L440 ceAbstractionStarter]: At program point L3385-7(lines 3385 3388) the Hoare annotation is: false [2019-11-24 02:04:46,955 INFO L440 ceAbstractionStarter]: At program point L3385-6(lines 3385 3388) the Hoare annotation is: false [2019-11-24 02:04:46,955 INFO L447 ceAbstractionStarter]: At program point L2861-1(lines 2860 2863) the Hoare annotation is: true [2019-11-24 02:04:46,955 INFO L447 ceAbstractionStarter]: At program point L2861(lines 2860 2863) the Hoare annotation is: true [2019-11-24 02:04:46,955 INFO L447 ceAbstractionStarter]: At program point L2861-3(lines 2860 2863) the Hoare annotation is: true [2019-11-24 02:04:46,955 INFO L447 ceAbstractionStarter]: At program point L2861-2(lines 2860 2863) the Hoare annotation is: true [2019-11-24 02:04:46,956 INFO L447 ceAbstractionStarter]: At program point L2861-5(lines 2860 2863) the Hoare annotation is: true [2019-11-24 02:04:46,956 INFO L447 ceAbstractionStarter]: At program point L2861-4(lines 2860 2863) the Hoare annotation is: true [2019-11-24 02:04:46,956 INFO L440 ceAbstractionStarter]: At program point L3654(lines 3654 3658) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,956 INFO L447 ceAbstractionStarter]: At program point L2861-7(lines 2860 2863) the Hoare annotation is: true [2019-11-24 02:04:46,956 INFO L447 ceAbstractionStarter]: At program point L2861-6(lines 2860 2863) the Hoare annotation is: true [2019-11-24 02:04:46,956 INFO L447 ceAbstractionStarter]: At program point L2861-9(lines 2860 2863) the Hoare annotation is: true [2019-11-24 02:04:46,956 INFO L447 ceAbstractionStarter]: At program point L2861-8(lines 2860 2863) the Hoare annotation is: true [2019-11-24 02:04:46,956 INFO L447 ceAbstractionStarter]: At program point L2861-11(lines 2860 2863) the Hoare annotation is: true [2019-11-24 02:04:46,956 INFO L447 ceAbstractionStarter]: At program point L2861-10(lines 2860 2863) the Hoare annotation is: true [2019-11-24 02:04:46,957 INFO L447 ceAbstractionStarter]: At program point L2861-13(lines 2860 2863) the Hoare annotation is: true [2019-11-24 02:04:46,957 INFO L447 ceAbstractionStarter]: At program point L2861-12(lines 2860 2863) the Hoare annotation is: true [2019-11-24 02:04:46,957 INFO L444 ceAbstractionStarter]: For program point L4183(line 4183) no Hoare annotation was computed. [2019-11-24 02:04:46,957 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 2855) no Hoare annotation was computed. [2019-11-24 02:04:46,957 INFO L440 ceAbstractionStarter]: At program point L3132(lines 3112 3177) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,957 INFO L444 ceAbstractionStarter]: For program point L3661(lines 3661 3665) no Hoare annotation was computed. [2019-11-24 02:04:46,957 INFO L444 ceAbstractionStarter]: For program point L4190(line 4190) no Hoare annotation was computed. [2019-11-24 02:04:46,957 INFO L444 ceAbstractionStarter]: For program point L4191(lines 4191 4218) no Hoare annotation was computed. [2019-11-24 02:04:46,958 INFO L444 ceAbstractionStarter]: For program point L4194(line 4194) no Hoare annotation was computed. [2019-11-24 02:04:46,958 INFO L440 ceAbstractionStarter]: At program point L3137(lines 3137 3140) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,958 INFO L440 ceAbstractionStarter]: At program point L3402(lines 3358 3404) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,958 INFO L440 ceAbstractionStarter]: At program point L3402-2(lines 3358 3404) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,958 INFO L440 ceAbstractionStarter]: At program point L3402-1(lines 3358 3404) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,958 INFO L440 ceAbstractionStarter]: At program point L3402-4(lines 3358 3404) the Hoare annotation is: (and (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,958 INFO L440 ceAbstractionStarter]: At program point L3402-3(lines 3358 3404) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,958 INFO L440 ceAbstractionStarter]: At program point L3402-6(lines 3358 3404) the Hoare annotation is: false [2019-11-24 02:04:46,958 INFO L440 ceAbstractionStarter]: At program point L3402-5(lines 3358 3404) the Hoare annotation is: false [2019-11-24 02:04:46,959 INFO L440 ceAbstractionStarter]: At program point L4195(lines 4195 4203) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:46,959 INFO L440 ceAbstractionStarter]: At program point L3402-7(lines 3358 3404) the Hoare annotation is: false [2019-11-24 02:04:46,959 INFO L440 ceAbstractionStarter]: At program point L3668(lines 3668 3671) the Hoare annotation is: (and (= 0 ~ldv_irq_2_3~0) (= 0 ~ldv_irq_2_1~0) (= 0 ~ldv_irq_2_2~0) (= ~ldv_spin~0 0)) [2019-11-24 02:04:47,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 02:04:47 BoogieIcfgContainer [2019-11-24 02:04:47,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 02:04:47,022 INFO L168 Benchmark]: Toolchain (without parser) took 40291.59 ms. Allocated memory was 145.8 MB in the beginning and 901.8 MB in the end (delta: 756.0 MB). Free memory was 98.1 MB in the beginning and 532.5 MB in the end (delta: -434.4 MB). Peak memory consumption was 706.0 MB. Max. memory is 7.1 GB. [2019-11-24 02:04:47,023 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 145.8 MB. Free memory is still 122.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-24 02:04:47,024 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1886.02 ms. Allocated memory was 145.8 MB in the beginning and 207.1 MB in the end (delta: 61.3 MB). Free memory was 97.9 MB in the beginning and 98.5 MB in the end (delta: -589.7 kB). Peak memory consumption was 68.6 MB. Max. memory is 7.1 GB. [2019-11-24 02:04:47,025 INFO L168 Benchmark]: Boogie Procedure Inliner took 375.67 ms. Allocated memory was 207.1 MB in the beginning and 240.6 MB in the end (delta: 33.6 MB). Free memory was 98.5 MB in the beginning and 170.0 MB in the end (delta: -71.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2019-11-24 02:04:47,025 INFO L168 Benchmark]: Boogie Preprocessor took 285.49 ms. Allocated memory is still 240.6 MB. Free memory was 170.0 MB in the beginning and 137.9 MB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 7.1 GB. [2019-11-24 02:04:47,026 INFO L168 Benchmark]: RCFGBuilder took 25467.26 ms. Allocated memory was 240.6 MB in the beginning and 598.7 MB in the end (delta: 358.1 MB). Free memory was 137.9 MB in the beginning and 167.2 MB in the end (delta: -29.3 MB). Peak memory consumption was 379.0 MB. Max. memory is 7.1 GB. [2019-11-24 02:04:47,027 INFO L168 Benchmark]: TraceAbstraction took 12271.91 ms. Allocated memory was 598.7 MB in the beginning and 901.8 MB in the end (delta: 303.0 MB). Free memory was 167.2 MB in the beginning and 532.5 MB in the end (delta: -365.3 MB). Peak memory consumption was 322.1 MB. Max. memory is 7.1 GB. [2019-11-24 02:04:47,031 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 145.8 MB. Free memory is still 122.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1886.02 ms. Allocated memory was 145.8 MB in the beginning and 207.1 MB in the end (delta: 61.3 MB). Free memory was 97.9 MB in the beginning and 98.5 MB in the end (delta: -589.7 kB). Peak memory consumption was 68.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 375.67 ms. Allocated memory was 207.1 MB in the beginning and 240.6 MB in the end (delta: 33.6 MB). Free memory was 98.5 MB in the beginning and 170.0 MB in the end (delta: -71.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 285.49 ms. Allocated memory is still 240.6 MB. Free memory was 170.0 MB in the beginning and 137.9 MB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 25467.26 ms. Allocated memory was 240.6 MB in the beginning and 598.7 MB in the end (delta: 358.1 MB). Free memory was 137.9 MB in the beginning and 167.2 MB in the end (delta: -29.3 MB). Peak memory consumption was 379.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12271.91 ms. Allocated memory was 598.7 MB in the beginning and 901.8 MB in the end (delta: 303.0 MB). Free memory was 167.2 MB in the beginning and 532.5 MB in the end (delta: -365.3 MB). Peak memory consumption was 322.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2855]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2855]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2855]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2855]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2855]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2855]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2855]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2855]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2855]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - InvariantResult [Line: 4205]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3137]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3957]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3957]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3957]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 2860]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2860]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2860]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3957]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 2860]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2860]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2860]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3370]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2860]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3370]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 2860]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3370]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 4133]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 2860]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3112]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3370]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3654]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 2860]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4166]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3370]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3370]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 2860]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2860]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3370]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 2860]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2860]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3370]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3406]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3438]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3438]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3406]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 4127]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 4000]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3406]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3438]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3438]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3406]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3438]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3406]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 4000]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3438]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3243]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3406]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3406]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3438]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3419]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3419]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3419]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3953]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3419]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3953]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3953]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3419]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3990]: Loop Invariant Derived loop invariant: (((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && 0 == state) && ldv_spin == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3990]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3953]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3419]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3990]: Loop Invariant Derived loop invariant: (((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && 0 == state) && ldv_spin == 0 - InvariantResult [Line: 3990]: Loop Invariant Derived loop invariant: (((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && 0 == state) && ldv_spin == 0 - InvariantResult [Line: 3419]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3358]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 4195]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3358]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3484]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3358]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3523]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3358]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3358]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3523]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3484]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3358]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3523]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3358]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3523]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3484]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((((((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_1_1) && 0 == ldv_irq_1_3) && 0 == ldv_irq_2_0) && ldv_state_variable_3 == 0) && 0 == ldv_irq_2_2) && 0 == ldv_irq_1_2) && 0 == ldv_irq_1_0) && ldv_spin == 0 - InvariantResult [Line: 3523]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3589]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3523]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3358]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3523]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3523]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3484]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((((((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_1_1) && 0 == ldv_irq_1_3) && 0 == ldv_irq_2_0) && ldv_state_variable_3 == 0) && 0 == ldv_irq_2_2) && 0 == ldv_irq_1_2) && 0 == ldv_irq_1_0) && ldv_spin == 0 - InvariantResult [Line: 3105]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 4367]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3385]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3484]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3385]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 4367]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3385]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 4367]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3589]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3578]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 4367]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3112]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3484]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3677]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 4367]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3385]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((((((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_1_1) && 0 == ldv_irq_1_3) && 0 == ldv_irq_2_0) && ldv_state_variable_3 == 0) && 0 == ldv_irq_2_2) && 0 == ldv_irq_1_2) && 0 == ldv_irq_1_0) && ldv_spin == 0 - InvariantResult [Line: 3996]: Loop Invariant Derived loop invariant: (((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && 0 == state) && ldv_spin == 0 - InvariantResult [Line: 3528]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3484]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3385]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3996]: Loop Invariant Derived loop invariant: (((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && 0 == state) && ldv_spin == 0 - InvariantResult [Line: 3528]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 4367]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3385]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3528]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3996]: Loop Invariant Derived loop invariant: (((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && 0 == state) && ldv_spin == 0 - InvariantResult [Line: 3385]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 4367]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((((((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_1_1) && 0 == ldv_irq_1_3) && 0 == ldv_irq_2_0) && ldv_state_variable_3 == 0) && 0 == ldv_irq_2_2) && 0 == ldv_irq_1_2) && 0 == ldv_irq_1_0) && ldv_spin == 0 - InvariantResult [Line: 4367]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3528]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3385]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 4367]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3528]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3528]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((((((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_1_1) && 0 == ldv_irq_1_3) && 0 == ldv_irq_2_0) && ldv_state_variable_3 == 0) && 0 == ldv_irq_2_2) && 0 == ldv_irq_1_2) && 0 == ldv_irq_1_0) && ldv_spin == 0 - InvariantResult [Line: 3528]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3484]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3996]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3528]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3167]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3322]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3591]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3668]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3322]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 4158]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3569]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 2818]: Loop Invariant Derived loop invariant: ((((((((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_1_1) && 0 == ldv_irq_1_3) && 0 == ldv_irq_2_0) && ldv_state_variable_3 == 0) && 0 == ldv_irq_2_2) && 0 == ldv_irq_1_2) && 0 == ldv_irq_1_0) && ldv_spin == 0 - InvariantResult [Line: 3322]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3322]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 2818]: Loop Invariant Derived loop invariant: ((((((((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_1_1) && 0 == ldv_irq_1_3) && 0 == ldv_irq_2_0) && ldv_state_variable_3 == 0) && 0 == ldv_irq_2_2) && 0 == ldv_irq_1_2) && 0 == ldv_irq_1_0) && ldv_spin == 0 - InvariantResult [Line: 3322]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 2818]: Loop Invariant Derived loop invariant: ((((((((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_1_1) && 0 == ldv_irq_1_3) && 0 == ldv_irq_2_0) && ldv_state_variable_3 == 0) && 0 == ldv_irq_2_2) && 0 == ldv_irq_1_2) && 0 == ldv_irq_1_0) && ldv_spin == 0 - InvariantResult [Line: 3322]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 2818]: Loop Invariant Derived loop invariant: ((((((((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_1_1) && 0 == ldv_irq_1_3) && 0 == ldv_irq_2_0) && ldv_state_variable_3 == 0) && 0 == ldv_irq_2_2) && 0 == ldv_irq_1_2) && 0 == ldv_irq_1_0) && ldv_spin == 0 - InvariantResult [Line: 3322]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2818]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3322]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3947]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3947]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3947]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 2818]: Loop Invariant Derived loop invariant: ((((((((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_1_1) && 0 == ldv_irq_1_3) && 0 == ldv_irq_2_0) && ldv_state_variable_3 == 0) && 0 == ldv_irq_2_2) && 0 == ldv_irq_1_2) && 0 == ldv_irq_1_0) && ldv_spin == 0 - InvariantResult [Line: 3947]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 4119]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3319]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3319]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3370]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3319]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3370]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3319]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3370]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3319]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3370]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3319]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3370]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 4094]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3319]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3370]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3260]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3319]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3370]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3370]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3419]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3112]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3558]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3333]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 4000]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 4000]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3406]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3438]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3284]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3333]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3443]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3333]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3469]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3443]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3469]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3333]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3469]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3469]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3443]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3469]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3443]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3333]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3443]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3469]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3333]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3469]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3469]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3419]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3419]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_1 && 0 == ldv_irq_2_3) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3443]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3419]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3333]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3333]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3615]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3419]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3443]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3419]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3419]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3419]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3443]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3419]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3231]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3243]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - InvariantResult [Line: 3685]: Loop Invariant Derived loop invariant: ((0 == ldv_irq_2_3 && 0 == ldv_irq_2_1) && 0 == ldv_irq_2_2) && ldv_spin == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 378 locations, 9 error locations. Result: SAFE, OverallTime: 12.1s, OverallIterations: 10, TraceHistogramMax: 2, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.1s, HoareTripleCheckerStatistics: 8171 SDtfs, 8701 SDslu, 8577 SDs, 0 SdLazy, 360 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2238occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 6781 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 234 LocationsWithAnnotation, 234 PreInvPairs, 1135 NumberOfFragments, 2340 HoareAnnotationTreeSize, 234 FomulaSimplifications, 253633 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 234 FomulaSimplificationsInter, 12417 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 306 NumberOfCodeBlocks, 306 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 296 ConstructedInterpolants, 0 QuantifiedInterpolants, 20552 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...