java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 05:21:17,582 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 05:21:17,583 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 05:21:17,592 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 05:21:17,592 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 05:21:17,593 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 05:21:17,594 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 05:21:17,598 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 05:21:17,600 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 05:21:17,600 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 05:21:17,600 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 05:21:17,601 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 05:21:17,601 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 05:21:17,602 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 05:21:17,602 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 05:21:17,603 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 05:21:17,606 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 05:21:17,607 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 05:21:17,608 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 05:21:17,608 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 05:21:17,610 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 05:21:17,610 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 05:21:17,610 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 05:21:17,610 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 05:21:17,618 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 05:21:17,618 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 05:21:17,619 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 05:21:17,619 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 05:21:17,619 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 05:21:17,619 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 05:21:17,619 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 05:21:17,620 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 05:21:17,630 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 05:21:17,630 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 05:21:17,630 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 05:21:17,631 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 05:21:17,631 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 05:21:17,631 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 05:21:17,631 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 05:21:17,631 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 05:21:17,631 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 05:21:17,631 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 05:21:17,631 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 05:21:17,631 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 05:21:17,632 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 05:21:17,632 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 05:21:17,632 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 05:21:17,632 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 05:21:17,632 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 05:21:17,632 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 05:21:17,632 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 05:21:17,632 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 05:21:17,632 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 05:21:17,632 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 05:21:17,632 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 05:21:17,632 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 05:21:17,633 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 05:21:17,633 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 05:21:17,633 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 05:21:17,633 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 05:21:17,633 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 05:21:17,633 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 05:21:17,633 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 05:21:17,633 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 05:21:17,634 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 05:21:17,634 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 05:21:17,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 05:21:17,671 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 05:21:17,673 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 05:21:17,673 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 05:21:17,674 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 05:21:17,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-01-30 05:21:17,752 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 05:21:17,753 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 05:21:17,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 05:21:17,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 05:21:17,757 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 05:21:17,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 05:21:17" (1/1) ... [2018-01-30 05:21:17,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a8a1214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:21:17, skipping insertion in model container [2018-01-30 05:21:17,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 05:21:17" (1/1) ... [2018-01-30 05:21:17,768 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 05:21:17,789 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 05:21:17,871 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 05:21:17,890 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 05:21:17,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:21:17 WrapperNode [2018-01-30 05:21:17,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 05:21:17,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 05:21:17,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 05:21:17,896 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 05:21:17,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:21:17" (1/1) ... [2018-01-30 05:21:17,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:21:17" (1/1) ... [2018-01-30 05:21:17,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:21:17" (1/1) ... [2018-01-30 05:21:17,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:21:17" (1/1) ... [2018-01-30 05:21:17,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:21:17" (1/1) ... [2018-01-30 05:21:17,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:21:17" (1/1) ... [2018-01-30 05:21:17,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:21:17" (1/1) ... [2018-01-30 05:21:17,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 05:21:17,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 05:21:17,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 05:21:17,945 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 05:21:17,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:21:17" (1/1) ... No working directory specified, using /home/daniel/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 [2018-01-30 05:21:17,979 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 05:21:17,979 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 05:21:17,979 INFO L136 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-01-30 05:21:17,979 INFO L136 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-01-30 05:21:17,979 INFO L136 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2018-01-30 05:21:17,980 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 05:21:17,980 INFO L136 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-01-30 05:21:17,980 INFO L136 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-01-30 05:21:17,980 INFO L136 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-01-30 05:21:17,980 INFO L136 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-01-30 05:21:17,980 INFO L136 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-01-30 05:21:17,980 INFO L136 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2018-01-30 05:21:17,980 INFO L136 BoogieDeclarations]: Found implementation of procedure errorFn [2018-01-30 05:21:17,980 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 05:21:17,980 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 05:21:17,980 INFO L128 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2018-01-30 05:21:17,980 INFO L128 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-01-30 05:21:17,980 INFO L128 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-01-30 05:21:17,981 INFO L128 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-01-30 05:21:17,981 INFO L128 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2018-01-30 05:21:17,981 INFO L128 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-01-30 05:21:17,981 INFO L128 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-01-30 05:21:17,981 INFO L128 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-01-30 05:21:17,981 INFO L128 BoogieDeclarations]: Found specification of procedure errorFn [2018-01-30 05:21:17,981 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 05:21:17,981 INFO L128 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-01-30 05:21:17,981 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 05:21:17,981 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 05:21:18,212 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 05:21:18,213 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 05:21:18,463 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 05:21:18,463 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 05:21:18,528 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 05:21:18,528 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 05:21:18,558 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 05:21:18,558 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 05:21:18,712 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 05:21:18,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:21:18 BoogieIcfgContainer [2018-01-30 05:21:18,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 05:21:18,713 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 05:21:18,713 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 05:21:18,714 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 05:21:18,715 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:21:18" (1/1) ... [2018-01-30 05:21:18,718 WARN L213 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-01-30 05:21:18,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 05:21:18 BasicIcfg [2018-01-30 05:21:18,732 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 05:21:18,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 05:21:18,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 05:21:18,735 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 05:21:18,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 05:21:17" (1/4) ... [2018-01-30 05:21:18,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18323bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 05:21:18, skipping insertion in model container [2018-01-30 05:21:18,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:21:17" (2/4) ... [2018-01-30 05:21:18,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18323bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 05:21:18, skipping insertion in model container [2018-01-30 05:21:18,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:21:18" (3/4) ... [2018-01-30 05:21:18,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18323bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 05:21:18, skipping insertion in model container [2018-01-30 05:21:18,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 05:21:18" (4/4) ... [2018-01-30 05:21:18,737 INFO L107 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.cleft_unchanged_by_heapseparator [2018-01-30 05:21:18,741 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 05:21:18,746 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 05:21:18,771 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 05:21:18,771 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 05:21:18,771 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 05:21:18,771 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 05:21:18,771 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 05:21:18,771 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 05:21:18,772 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 05:21:18,772 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 05:21:18,772 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 05:21:18,787 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states. [2018-01-30 05:21:18,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-30 05:21:18,792 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:18,792 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:21:18,792 INFO L371 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:18,795 INFO L82 PathProgramCache]: Analyzing trace with hash 707225957, now seen corresponding path program 1 times [2018-01-30 05:21:18,796 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:18,796 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:18,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:18,824 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:18,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:18,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:18,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:21:18,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:18,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:21:18,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:21:18,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:21:18,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:21:18,962 INFO L87 Difference]: Start difference. First operand 366 states. Second operand 3 states. [2018-01-30 05:21:19,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:19,177 INFO L93 Difference]: Finished difference Result 637 states and 780 transitions. [2018-01-30 05:21:19,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:21:19,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-01-30 05:21:19,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:19,190 INFO L225 Difference]: With dead ends: 637 [2018-01-30 05:21:19,190 INFO L226 Difference]: Without dead ends: 353 [2018-01-30 05:21:19,193 INFO L553 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 [2018-01-30 05:21:19,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-01-30 05:21:19,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2018-01-30 05:21:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-01-30 05:21:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 412 transitions. [2018-01-30 05:21:19,238 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 412 transitions. Word has length 83 [2018-01-30 05:21:19,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:19,239 INFO L432 AbstractCegarLoop]: Abstraction has 353 states and 412 transitions. [2018-01-30 05:21:19,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:21:19,239 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 412 transitions. [2018-01-30 05:21:19,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-01-30 05:21:19,242 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:19,242 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:21:19,242 INFO L371 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:19,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1725114378, now seen corresponding path program 1 times [2018-01-30 05:21:19,242 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:19,242 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:19,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:19,243 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:19,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:19,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:21:19,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:19,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:21:19,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:21:19,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:21:19,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:21:19,562 INFO L87 Difference]: Start difference. First operand 353 states and 412 transitions. Second operand 3 states. [2018-01-30 05:21:19,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:19,916 INFO L93 Difference]: Finished difference Result 649 states and 762 transitions. [2018-01-30 05:21:19,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:21:19,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2018-01-30 05:21:19,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:19,920 INFO L225 Difference]: With dead ends: 649 [2018-01-30 05:21:19,920 INFO L226 Difference]: Without dead ends: 473 [2018-01-30 05:21:19,921 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:21:19,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-01-30 05:21:19,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 470. [2018-01-30 05:21:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-01-30 05:21:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 542 transitions. [2018-01-30 05:21:19,941 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 542 transitions. Word has length 146 [2018-01-30 05:21:19,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:19,941 INFO L432 AbstractCegarLoop]: Abstraction has 470 states and 542 transitions. [2018-01-30 05:21:19,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:21:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 542 transitions. [2018-01-30 05:21:19,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-01-30 05:21:19,944 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:19,944 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:21:19,944 INFO L371 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:19,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1656843151, now seen corresponding path program 1 times [2018-01-30 05:21:19,944 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:19,944 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:19,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:19,945 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:19,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:19,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:21:20,142 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:20,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:21:20,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:21:20,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:21:20,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:21:20,143 INFO L87 Difference]: Start difference. First operand 470 states and 542 transitions. Second operand 4 states. [2018-01-30 05:21:20,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:20,488 INFO L93 Difference]: Finished difference Result 960 states and 1123 transitions. [2018-01-30 05:21:20,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:21:20,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-01-30 05:21:20,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:20,494 INFO L225 Difference]: With dead ends: 960 [2018-01-30 05:21:20,494 INFO L226 Difference]: Without dead ends: 695 [2018-01-30 05:21:20,497 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:21:20,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-01-30 05:21:20,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 692. [2018-01-30 05:21:20,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2018-01-30 05:21:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 808 transitions. [2018-01-30 05:21:20,527 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 808 transitions. Word has length 148 [2018-01-30 05:21:20,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:20,528 INFO L432 AbstractCegarLoop]: Abstraction has 692 states and 808 transitions. [2018-01-30 05:21:20,528 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:21:20,528 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 808 transitions. [2018-01-30 05:21:20,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-01-30 05:21:20,536 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:20,536 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:21:20,536 INFO L371 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:20,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1853826995, now seen corresponding path program 1 times [2018-01-30 05:21:20,536 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:20,536 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:20,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:20,537 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:20,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:20,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:21:20,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:20,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:21:20,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:21:20,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:21:20,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:21:20,648 INFO L87 Difference]: Start difference. First operand 692 states and 808 transitions. Second operand 3 states. [2018-01-30 05:21:20,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:20,809 INFO L93 Difference]: Finished difference Result 694 states and 809 transitions. [2018-01-30 05:21:20,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:21:20,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-01-30 05:21:20,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:20,811 INFO L225 Difference]: With dead ends: 694 [2018-01-30 05:21:20,811 INFO L226 Difference]: Without dead ends: 659 [2018-01-30 05:21:20,812 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:21:20,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-01-30 05:21:20,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 658. [2018-01-30 05:21:20,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2018-01-30 05:21:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 766 transitions. [2018-01-30 05:21:20,825 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 766 transitions. Word has length 172 [2018-01-30 05:21:20,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:20,826 INFO L432 AbstractCegarLoop]: Abstraction has 658 states and 766 transitions. [2018-01-30 05:21:20,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:21:20,826 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 766 transitions. [2018-01-30 05:21:20,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-01-30 05:21:20,828 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:20,828 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:21:20,828 INFO L371 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:20,828 INFO L82 PathProgramCache]: Analyzing trace with hash -551714501, now seen corresponding path program 1 times [2018-01-30 05:21:20,828 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:20,828 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:20,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:20,829 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:20,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:20,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:21,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:21:21,010 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:21,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:21:21,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:21:21,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:21:21,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:21:21,011 INFO L87 Difference]: Start difference. First operand 658 states and 766 transitions. Second operand 4 states. [2018-01-30 05:21:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:21,303 INFO L93 Difference]: Finished difference Result 686 states and 795 transitions. [2018-01-30 05:21:21,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 05:21:21,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-01-30 05:21:21,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:21,305 INFO L225 Difference]: With dead ends: 686 [2018-01-30 05:21:21,305 INFO L226 Difference]: Without dead ends: 573 [2018-01-30 05:21:21,305 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:21:21,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-01-30 05:21:21,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 561. [2018-01-30 05:21:21,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-01-30 05:21:21,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 647 transitions. [2018-01-30 05:21:21,315 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 647 transitions. Word has length 186 [2018-01-30 05:21:21,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:21,315 INFO L432 AbstractCegarLoop]: Abstraction has 561 states and 647 transitions. [2018-01-30 05:21:21,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:21:21,315 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 647 transitions. [2018-01-30 05:21:21,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-01-30 05:21:21,316 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:21,316 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:21:21,317 INFO L371 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:21,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1320297101, now seen corresponding path program 1 times [2018-01-30 05:21:21,317 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:21,317 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:21,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:21,317 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:21,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:21,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:21,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:21:21,389 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:21,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:21:21,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:21:21,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:21:21,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:21:21,390 INFO L87 Difference]: Start difference. First operand 561 states and 647 transitions. Second operand 3 states. [2018-01-30 05:21:21,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:21,480 INFO L93 Difference]: Finished difference Result 589 states and 683 transitions. [2018-01-30 05:21:21,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:21:21,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2018-01-30 05:21:21,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:21,485 INFO L225 Difference]: With dead ends: 589 [2018-01-30 05:21:21,485 INFO L226 Difference]: Without dead ends: 330 [2018-01-30 05:21:21,485 INFO L553 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 [2018-01-30 05:21:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-01-30 05:21:21,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2018-01-30 05:21:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-01-30 05:21:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 352 transitions. [2018-01-30 05:21:21,491 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 352 transitions. Word has length 191 [2018-01-30 05:21:21,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:21,491 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 352 transitions. [2018-01-30 05:21:21,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:21:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 352 transitions. [2018-01-30 05:21:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-01-30 05:21:21,493 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:21,493 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:21:21,493 INFO L371 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:21,493 INFO L82 PathProgramCache]: Analyzing trace with hash 2017104018, now seen corresponding path program 1 times [2018-01-30 05:21:21,493 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:21,493 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:21,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:21,494 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:21,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:21,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:21,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:21:21,576 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:21,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:21:21,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:21:21,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:21:21,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:21:21,577 INFO L87 Difference]: Start difference. First operand 330 states and 352 transitions. Second operand 3 states. [2018-01-30 05:21:21,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:21,778 INFO L93 Difference]: Finished difference Result 377 states and 405 transitions. [2018-01-30 05:21:21,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:21:21,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2018-01-30 05:21:21,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:21,779 INFO L225 Difference]: With dead ends: 377 [2018-01-30 05:21:21,779 INFO L226 Difference]: Without dead ends: 280 [2018-01-30 05:21:21,780 INFO L553 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 [2018-01-30 05:21:21,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-01-30 05:21:21,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2018-01-30 05:21:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-01-30 05:21:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 292 transitions. [2018-01-30 05:21:21,784 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 292 transitions. Word has length 200 [2018-01-30 05:21:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:21,784 INFO L432 AbstractCegarLoop]: Abstraction has 280 states and 292 transitions. [2018-01-30 05:21:21,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:21:21,784 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 292 transitions. [2018-01-30 05:21:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-01-30 05:21:21,786 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:21,786 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:21:21,786 INFO L371 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:21,786 INFO L82 PathProgramCache]: Analyzing trace with hash -530360286, now seen corresponding path program 1 times [2018-01-30 05:21:21,786 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:21,786 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:21,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:21,787 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:21,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:21,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:21:22,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:22,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 05:21:22,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 05:21:22,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 05:21:22,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 05:21:22,167 INFO L87 Difference]: Start difference. First operand 280 states and 292 transitions. Second operand 7 states. [2018-01-30 05:21:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:22,539 INFO L93 Difference]: Finished difference Result 361 states and 384 transitions. [2018-01-30 05:21:22,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 05:21:22,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 216 [2018-01-30 05:21:22,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:22,541 INFO L225 Difference]: With dead ends: 361 [2018-01-30 05:21:22,541 INFO L226 Difference]: Without dead ends: 312 [2018-01-30 05:21:22,541 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-01-30 05:21:22,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-01-30 05:21:22,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 297. [2018-01-30 05:21:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-01-30 05:21:22,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 312 transitions. [2018-01-30 05:21:22,546 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 312 transitions. Word has length 216 [2018-01-30 05:21:22,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:22,547 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 312 transitions. [2018-01-30 05:21:22,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 05:21:22,547 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 312 transitions. [2018-01-30 05:21:22,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-01-30 05:21:22,548 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:22,548 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:21:22,548 INFO L371 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:22,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1177234676, now seen corresponding path program 1 times [2018-01-30 05:21:22,548 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:22,549 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:22,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:22,549 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:22,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:22,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:22,769 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 11 DAG size of output 4 [2018-01-30 05:21:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:21:23,061 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:23,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 05:21:23,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 05:21:23,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 05:21:23,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-30 05:21:23,062 INFO L87 Difference]: Start difference. First operand 297 states and 312 transitions. Second operand 8 states. [2018-01-30 05:21:23,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:23,847 INFO L93 Difference]: Finished difference Result 376 states and 398 transitions. [2018-01-30 05:21:23,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 05:21:23,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 217 [2018-01-30 05:21:23,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:23,849 INFO L225 Difference]: With dead ends: 376 [2018-01-30 05:21:23,849 INFO L226 Difference]: Without dead ends: 313 [2018-01-30 05:21:23,849 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-01-30 05:21:23,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-01-30 05:21:23,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 292. [2018-01-30 05:21:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-01-30 05:21:23,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 304 transitions. [2018-01-30 05:21:23,854 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 304 transitions. Word has length 217 [2018-01-30 05:21:23,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:23,854 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 304 transitions. [2018-01-30 05:21:23,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 05:21:23,854 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 304 transitions. [2018-01-30 05:21:23,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-01-30 05:21:23,856 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:23,856 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:21:23,856 INFO L371 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:23,856 INFO L82 PathProgramCache]: Analyzing trace with hash -687787861, now seen corresponding path program 1 times [2018-01-30 05:21:23,856 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:23,856 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:23,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:23,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:23,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:23,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:23,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:21:23,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:23,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:21:23,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:21:23,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:21:23,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:21:23,957 INFO L87 Difference]: Start difference. First operand 292 states and 304 transitions. Second operand 3 states. [2018-01-30 05:21:24,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:24,038 INFO L93 Difference]: Finished difference Result 502 states and 524 transitions. [2018-01-30 05:21:24,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:21:24,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2018-01-30 05:21:24,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:24,040 INFO L225 Difference]: With dead ends: 502 [2018-01-30 05:21:24,040 INFO L226 Difference]: Without dead ends: 490 [2018-01-30 05:21:24,040 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:21:24,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-01-30 05:21:24,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 470. [2018-01-30 05:21:24,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-01-30 05:21:24,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 492 transitions. [2018-01-30 05:21:24,048 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 492 transitions. Word has length 217 [2018-01-30 05:21:24,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:24,048 INFO L432 AbstractCegarLoop]: Abstraction has 470 states and 492 transitions. [2018-01-30 05:21:24,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:21:24,048 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 492 transitions. [2018-01-30 05:21:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-01-30 05:21:24,049 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:24,050 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:21:24,050 INFO L371 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:24,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1889825842, now seen corresponding path program 1 times [2018-01-30 05:21:24,050 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:24,050 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:24,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:24,050 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:24,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:24,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:24,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:21:24,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:24,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 05:21:24,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 05:21:24,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 05:21:24,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:21:24,241 INFO L87 Difference]: Start difference. First operand 470 states and 492 transitions. Second operand 6 states. [2018-01-30 05:21:24,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:24,584 INFO L93 Difference]: Finished difference Result 552 states and 586 transitions. [2018-01-30 05:21:24,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:21:24,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 219 [2018-01-30 05:21:24,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:24,585 INFO L225 Difference]: With dead ends: 552 [2018-01-30 05:21:24,585 INFO L226 Difference]: Without dead ends: 440 [2018-01-30 05:21:24,586 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-30 05:21:24,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-01-30 05:21:24,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2018-01-30 05:21:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-01-30 05:21:24,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 458 transitions. [2018-01-30 05:21:24,593 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 458 transitions. Word has length 219 [2018-01-30 05:21:24,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:24,593 INFO L432 AbstractCegarLoop]: Abstraction has 440 states and 458 transitions. [2018-01-30 05:21:24,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 05:21:24,593 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 458 transitions. [2018-01-30 05:21:24,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-01-30 05:21:24,595 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:24,595 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:21:24,595 INFO L371 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:24,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1861329096, now seen corresponding path program 1 times [2018-01-30 05:21:24,595 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:24,595 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:24,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:24,596 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:24,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:24,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:21:24,995 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:24,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 05:21:24,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 05:21:24,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 05:21:24,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-30 05:21:24,996 INFO L87 Difference]: Start difference. First operand 440 states and 458 transitions. Second operand 7 states. [2018-01-30 05:21:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:25,247 INFO L93 Difference]: Finished difference Result 485 states and 505 transitions. [2018-01-30 05:21:25,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 05:21:25,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 223 [2018-01-30 05:21:25,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:25,251 INFO L225 Difference]: With dead ends: 485 [2018-01-30 05:21:25,251 INFO L226 Difference]: Without dead ends: 446 [2018-01-30 05:21:25,251 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:21:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-01-30 05:21:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2018-01-30 05:21:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-01-30 05:21:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 462 transitions. [2018-01-30 05:21:25,265 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 462 transitions. Word has length 223 [2018-01-30 05:21:25,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:25,265 INFO L432 AbstractCegarLoop]: Abstraction has 446 states and 462 transitions. [2018-01-30 05:21:25,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 05:21:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 462 transitions. [2018-01-30 05:21:25,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-01-30 05:21:25,266 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:25,266 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:21:25,266 INFO L371 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:25,266 INFO L82 PathProgramCache]: Analyzing trace with hash -49307866, now seen corresponding path program 1 times [2018-01-30 05:21:25,266 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:25,266 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:25,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:25,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:25,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:25,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:25,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:21:25,361 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:25,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:21:25,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:21:25,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:21:25,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:21:25,362 INFO L87 Difference]: Start difference. First operand 446 states and 462 transitions. Second operand 3 states. [2018-01-30 05:21:25,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:25,564 INFO L93 Difference]: Finished difference Result 541 states and 565 transitions. [2018-01-30 05:21:25,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:21:25,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2018-01-30 05:21:25,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:25,565 INFO L225 Difference]: With dead ends: 541 [2018-01-30 05:21:25,565 INFO L226 Difference]: Without dead ends: 489 [2018-01-30 05:21:25,566 INFO L553 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 [2018-01-30 05:21:25,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-01-30 05:21:25,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 487. [2018-01-30 05:21:25,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-01-30 05:21:25,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 505 transitions. [2018-01-30 05:21:25,574 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 505 transitions. Word has length 224 [2018-01-30 05:21:25,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:25,574 INFO L432 AbstractCegarLoop]: Abstraction has 487 states and 505 transitions. [2018-01-30 05:21:25,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:21:25,574 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 505 transitions. [2018-01-30 05:21:25,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-01-30 05:21:25,575 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:25,575 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:21:25,575 INFO L371 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:25,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1559260985, now seen corresponding path program 1 times [2018-01-30 05:21:25,575 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:25,576 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:25,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:25,576 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:25,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:25,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:25,924 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 13 DAG size of output 3 [2018-01-30 05:21:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:21:26,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:26,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 05:21:26,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:21:26,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:21:26,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:21:26,217 INFO L87 Difference]: Start difference. First operand 487 states and 505 transitions. Second operand 5 states. [2018-01-30 05:21:26,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:26,625 INFO L93 Difference]: Finished difference Result 544 states and 565 transitions. [2018-01-30 05:21:26,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 05:21:26,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2018-01-30 05:21:26,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:26,627 INFO L225 Difference]: With dead ends: 544 [2018-01-30 05:21:26,627 INFO L226 Difference]: Without dead ends: 426 [2018-01-30 05:21:26,627 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 05:21:26,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-01-30 05:21:26,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 404. [2018-01-30 05:21:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-01-30 05:21:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 411 transitions. [2018-01-30 05:21:26,635 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 411 transitions. Word has length 225 [2018-01-30 05:21:26,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:26,635 INFO L432 AbstractCegarLoop]: Abstraction has 404 states and 411 transitions. [2018-01-30 05:21:26,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:21:26,635 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 411 transitions. [2018-01-30 05:21:26,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-01-30 05:21:26,636 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:26,636 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:21:26,636 INFO L371 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:26,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1734239298, now seen corresponding path program 1 times [2018-01-30 05:21:26,636 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:26,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:26,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:26,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:26,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:26,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:27,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:21:27,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:27,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 05:21:27,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 05:21:27,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 05:21:27,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 05:21:27,200 INFO L87 Difference]: Start difference. First operand 404 states and 411 transitions. Second operand 7 states. [2018-01-30 05:21:27,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:27,273 INFO L93 Difference]: Finished difference Result 427 states and 434 transitions. [2018-01-30 05:21:27,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 05:21:27,274 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 226 [2018-01-30 05:21:27,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:27,275 INFO L225 Difference]: With dead ends: 427 [2018-01-30 05:21:27,275 INFO L226 Difference]: Without dead ends: 410 [2018-01-30 05:21:27,275 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-30 05:21:27,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-01-30 05:21:27,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 404. [2018-01-30 05:21:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-01-30 05:21:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 409 transitions. [2018-01-30 05:21:27,294 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 409 transitions. Word has length 226 [2018-01-30 05:21:27,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:27,294 INFO L432 AbstractCegarLoop]: Abstraction has 404 states and 409 transitions. [2018-01-30 05:21:27,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 05:21:27,294 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 409 transitions. [2018-01-30 05:21:27,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-01-30 05:21:27,295 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:21:27,295 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:21:27,295 INFO L371 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0AssertViolation]=== [2018-01-30 05:21:27,295 INFO L82 PathProgramCache]: Analyzing trace with hash 25164033, now seen corresponding path program 1 times [2018-01-30 05:21:27,295 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:21:27,295 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:21:27,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:27,296 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:21:27,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:21:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:21:27,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:21:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:21:27,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:21:27,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 05:21:27,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:21:27,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:21:27,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:21:27,385 INFO L87 Difference]: Start difference. First operand 404 states and 409 transitions. Second operand 5 states. [2018-01-30 05:21:28,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:21:28,130 INFO L93 Difference]: Finished difference Result 404 states and 409 transitions. [2018-01-30 05:21:28,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:21:28,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2018-01-30 05:21:28,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:21:28,130 INFO L225 Difference]: With dead ends: 404 [2018-01-30 05:21:28,130 INFO L226 Difference]: Without dead ends: 0 [2018-01-30 05:21:28,131 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:21:28,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-30 05:21:28,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-30 05:21:28,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-30 05:21:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-30 05:21:28,131 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 245 [2018-01-30 05:21:28,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:21:28,131 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-30 05:21:28,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:21:28,132 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-30 05:21:28,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-30 05:21:28,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-30 05:21:28,251 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 05:21:28,256 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 05:21:28,274 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 05:21:28,279 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 05:21:28,927 WARN L146 SmtUtils]: Spent 647ms on a formula simplification. DAG size of input: 44 DAG size of output 38 [2018-01-30 05:21:29,257 WARN L146 SmtUtils]: Spent 328ms on a formula simplification. DAG size of input: 23 DAG size of output 21 [2018-01-30 05:21:29,404 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 44 DAG size of output 32 [2018-01-30 05:21:29,538 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 45 DAG size of output 33 [2018-01-30 05:21:30,338 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 35 DAG size of output 24 [2018-01-30 05:21:30,705 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 48 DAG size of output 39 [2018-01-30 05:21:31,423 INFO L399 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 514 521) no Hoare annotation was computed. [2018-01-30 05:21:31,423 INFO L399 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 514 521) no Hoare annotation was computed. [2018-01-30 05:21:31,423 INFO L399 ceAbstractionStarter]: For program point L519(line 519) no Hoare annotation was computed. [2018-01-30 05:21:31,423 INFO L399 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-01-30 05:21:31,423 INFO L402 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 514 521) the Hoare annotation is: true [2018-01-30 05:21:31,423 INFO L399 ceAbstractionStarter]: For program point L514'(lines 514 521) no Hoare annotation was computed. [2018-01-30 05:21:31,423 INFO L399 ceAbstractionStarter]: For program point L515'(line 515) no Hoare annotation was computed. [2018-01-30 05:21:31,423 INFO L399 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-01-30 05:21:31,423 INFO L399 ceAbstractionStarter]: For program point L514(lines 514 521) no Hoare annotation was computed. [2018-01-30 05:21:31,423 INFO L399 ceAbstractionStarter]: For program point L515''(line 515) no Hoare annotation was computed. [2018-01-30 05:21:31,423 INFO L402 ceAbstractionStarter]: At program point L570(line 570) the Hoare annotation is: true [2018-01-30 05:21:31,423 INFO L399 ceAbstractionStarter]: For program point L570'(line 570) no Hoare annotation was computed. [2018-01-30 05:21:31,424 INFO L399 ceAbstractionStarter]: For program point L564(lines 564 574) no Hoare annotation was computed. [2018-01-30 05:21:31,424 INFO L399 ceAbstractionStarter]: For program point L570''(line 570) no Hoare annotation was computed. [2018-01-30 05:21:31,424 INFO L399 ceAbstractionStarter]: For program point L564'(lines 564 574) no Hoare annotation was computed. [2018-01-30 05:21:31,424 INFO L399 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-01-30 05:21:31,424 INFO L399 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-01-30 05:21:31,424 INFO L399 ceAbstractionStarter]: For program point KbFilter_CompleteEXIT(lines 564 574) no Hoare annotation was computed. [2018-01-30 05:21:31,424 INFO L402 ceAbstractionStarter]: At program point KbFilter_CompleteENTRY(lines 564 574) the Hoare annotation is: true [2018-01-30 05:21:31,424 INFO L399 ceAbstractionStarter]: For program point KbFilter_CompleteFINAL(lines 564 574) no Hoare annotation was computed. [2018-01-30 05:21:31,425 INFO L399 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-01-30 05:21:31,425 INFO L399 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 36 49) no Hoare annotation was computed. [2018-01-30 05:21:31,426 INFO L395 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 36 49) the Hoare annotation is: (or (= ~s 1) (not (= |old(~s)| 1)) (not (= |old(~s)| ~NP)) (< ~MPR1 (+ ~NP 4))) [2018-01-30 05:21:31,426 INFO L399 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 36 49) no Hoare annotation was computed. [2018-01-30 05:21:31,426 INFO L399 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-01-30 05:21:31,426 INFO L399 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-01-30 05:21:31,426 INFO L399 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-01-30 05:21:31,426 INFO L399 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-01-30 05:21:31,426 INFO L399 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2018-01-30 05:21:31,426 INFO L399 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-01-30 05:21:31,426 INFO L399 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 50 71) no Hoare annotation was computed. [2018-01-30 05:21:31,426 INFO L399 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-01-30 05:21:31,426 INFO L399 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-01-30 05:21:31,426 INFO L399 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-01-30 05:21:31,426 INFO L399 ceAbstractionStarter]: For program point L62(line 62) no Hoare annotation was computed. [2018-01-30 05:21:31,426 INFO L399 ceAbstractionStarter]: For program point L65(line 65) no Hoare annotation was computed. [2018-01-30 05:21:31,426 INFO L395 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 50 71) the Hoare annotation is: (or (< ~myStatus 0) (= |old(~pended)| 1) (< |old(~compRegistered)| 0) (< 1 |old(~NP)|) (and (= ~lowerDriverReturn 0) (<= 0 ~compRegistered) (= ~s |old(~s)|) (<= ~NP 1) (<= ~compRegistered 0) (not (= ~pended 1))) (not (= |old(~lowerDriverReturn)| 0)) (< 0 |old(~compRegistered)|)) [2018-01-30 05:21:31,426 INFO L399 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-01-30 05:21:31,426 INFO L399 ceAbstractionStarter]: For program point L56(line 56) no Hoare annotation was computed. [2018-01-30 05:21:31,426 INFO L399 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-01-30 05:21:31,427 INFO L399 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 50 71) no Hoare annotation was computed. [2018-01-30 05:21:31,427 INFO L399 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-01-30 05:21:31,427 INFO L399 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-01-30 05:21:31,427 INFO L399 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-01-30 05:21:31,427 INFO L399 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-01-30 05:21:31,427 INFO L399 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-01-30 05:21:31,427 INFO L399 ceAbstractionStarter]: For program point L59(line 59) no Hoare annotation was computed. [2018-01-30 05:21:31,427 INFO L399 ceAbstractionStarter]: For program point errorFnErr0AssertViolation(line 580) no Hoare annotation was computed. [2018-01-30 05:21:31,427 INFO L402 ceAbstractionStarter]: At program point errorFnENTRY(lines 576 583) the Hoare annotation is: true [2018-01-30 05:21:31,427 INFO L399 ceAbstractionStarter]: For program point errorFnFINAL(lines 576 583) no Hoare annotation was computed. [2018-01-30 05:21:31,427 INFO L399 ceAbstractionStarter]: For program point errorFnEXIT(lines 576 583) no Hoare annotation was computed. [2018-01-30 05:21:31,427 INFO L399 ceAbstractionStarter]: For program point L384(lines 384 415) no Hoare annotation was computed. [2018-01-30 05:21:31,427 INFO L399 ceAbstractionStarter]: For program point L340(line 340) no Hoare annotation was computed. [2018-01-30 05:21:31,427 INFO L395 ceAbstractionStarter]: At program point L383(lines 383 415) the Hoare annotation is: (or (< |old(~myStatus)| 0) (= |old(~pended)| 1) (< |old(~compRegistered)| 0) (< 1 |old(~NP)|) (not (= |old(~lowerDriverReturn)| 0)) (< 0 |old(~compRegistered)|) (and (<= 0 ~compRegistered) (not (= ~pended 1)))) [2018-01-30 05:21:31,427 INFO L399 ceAbstractionStarter]: For program point L300(line 300) no Hoare annotation was computed. [2018-01-30 05:21:31,427 INFO L399 ceAbstractionStarter]: For program point L388(lines 388 390) no Hoare annotation was computed. [2018-01-30 05:21:31,427 INFO L399 ceAbstractionStarter]: For program point L387(lines 387 393) no Hoare annotation was computed. [2018-01-30 05:21:31,427 INFO L399 ceAbstractionStarter]: For program point L343(line 343) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L386(lines 386 413) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L385(lines 385 414) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L302(line 302) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L301(line 301) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L289''(line 289) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L308(line 308) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L307(line 307) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L306(line 306) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L349(line 349) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L309(line 309) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L292''(line 292) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L294(line 294) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L370(line 370) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L320'(line 320) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L377(lines 377 381) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L333(line 333) no Hoare annotation was computed. [2018-01-30 05:21:31,428 INFO L399 ceAbstractionStarter]: For program point L299(line 299) no Hoare annotation was computed. [2018-01-30 05:21:31,429 INFO L399 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2018-01-30 05:21:31,429 INFO L395 ceAbstractionStarter]: At program point L375(lines 375 416) the Hoare annotation is: (or (< |old(~myStatus)| 0) (= |old(~pended)| 1) (< |old(~compRegistered)| 0) (< 1 |old(~NP)|) (not (= |old(~lowerDriverReturn)| 0)) (< 0 |old(~compRegistered)|) (and (<= 0 ~compRegistered) (not (= ~pended 1)))) [2018-01-30 05:21:31,429 INFO L399 ceAbstractionStarter]: For program point L331(lines 331 334) no Hoare annotation was computed. [2018-01-30 05:21:31,429 INFO L399 ceAbstractionStarter]: For program point L330(line 330) no Hoare annotation was computed. [2018-01-30 05:21:31,429 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 287 421) no Hoare annotation was computed. [2018-01-30 05:21:31,429 INFO L399 ceAbstractionStarter]: For program point L336(line 336) no Hoare annotation was computed. [2018-01-30 05:21:31,429 INFO L399 ceAbstractionStarter]: For program point L378(line 378) no Hoare annotation was computed. [2018-01-30 05:21:31,429 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 287 421) no Hoare annotation was computed. [2018-01-30 05:21:31,429 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 287 421) the Hoare annotation is: (or (< |old(~myStatus)| 0) (= |old(~pended)| 1) (< |old(~compRegistered)| 0) (< 1 |old(~NP)|) (and (= ~lowerDriverReturn 0) (<= 0 ~compRegistered) (= ~s |old(~s)|) (<= ~NP 1) (<= 0 ~myStatus) (<= ~compRegistered 0) (not (= ~pended 1))) (not (= |old(~lowerDriverReturn)| 0)) (< 0 |old(~compRegistered)|)) [2018-01-30 05:21:31,429 INFO L395 ceAbstractionStarter]: At program point L331''(lines 331 334) the Hoare annotation is: (or (< |old(~myStatus)| 0) (= |old(~pended)| 1) (< |old(~compRegistered)| 0) (< 1 |old(~NP)|) (not (= |old(~lowerDriverReturn)| 0)) (< 0 |old(~compRegistered)|) (and (<= (+ ~NP 4) ~MPR1) (<= 0 main_~status~86) (= ~s ~NP) (= ~s 1))) [2018-01-30 05:21:31,429 INFO L399 ceAbstractionStarter]: For program point L350''(line 350) no Hoare annotation was computed. [2018-01-30 05:21:31,429 INFO L399 ceAbstractionStarter]: For program point L358''(line 358) no Hoare annotation was computed. [2018-01-30 05:21:31,429 INFO L399 ceAbstractionStarter]: For program point L289(line 289) no Hoare annotation was computed. [2018-01-30 05:21:31,429 INFO L395 ceAbstractionStarter]: At program point L322(lines 322 367) the Hoare annotation is: (or (< |old(~myStatus)| 0) (= |old(~pended)| 1) (< |old(~compRegistered)| 0) (< 1 |old(~NP)|) (not (= |old(~lowerDriverReturn)| 0)) (< 0 |old(~compRegistered)|) (and (<= 0 ~compRegistered) (not (= ~pended 1)))) [2018-01-30 05:21:31,429 INFO L395 ceAbstractionStarter]: At program point L320(line 320) the Hoare annotation is: (or (and (= ~lowerDriverReturn 0) (<= 0 ~compRegistered) (<= 0 main_~status~86) (<= ~NP 1) (<= 0 ~myStatus) (<= ~compRegistered 0) (not (= ~pended 1))) (< |old(~myStatus)| 0) (= |old(~pended)| 1) (< |old(~compRegistered)| 0) (< 1 |old(~NP)|) (not (= |old(~lowerDriverReturn)| 0)) (< 0 |old(~compRegistered)|)) [2018-01-30 05:21:31,429 INFO L399 ceAbstractionStarter]: For program point L326(line 326) no Hoare annotation was computed. [2018-01-30 05:21:31,429 INFO L399 ceAbstractionStarter]: For program point L403(lines 403 411) no Hoare annotation was computed. [2018-01-30 05:21:31,430 INFO L399 ceAbstractionStarter]: For program point L369(lines 369 373) no Hoare annotation was computed. [2018-01-30 05:21:31,430 INFO L399 ceAbstractionStarter]: For program point L325(line 325) no Hoare annotation was computed. [2018-01-30 05:21:31,430 INFO L399 ceAbstractionStarter]: For program point L324(line 324) no Hoare annotation was computed. [2018-01-30 05:21:31,430 INFO L399 ceAbstractionStarter]: For program point L323(line 323) no Hoare annotation was computed. [2018-01-30 05:21:31,430 INFO L399 ceAbstractionStarter]: For program point L329(line 329) no Hoare annotation was computed. [2018-01-30 05:21:31,430 INFO L399 ceAbstractionStarter]: For program point L292'(line 292) no Hoare annotation was computed. [2018-01-30 05:21:31,430 INFO L399 ceAbstractionStarter]: For program point L328(line 328) no Hoare annotation was computed. [2018-01-30 05:21:31,430 INFO L399 ceAbstractionStarter]: For program point L327(line 327) no Hoare annotation was computed. [2018-01-30 05:21:31,430 INFO L399 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2018-01-30 05:21:31,430 INFO L399 ceAbstractionStarter]: For program point L408(lines 408 410) no Hoare annotation was computed. [2018-01-30 05:21:31,430 INFO L399 ceAbstractionStarter]: For program point L358'(line 358) no Hoare annotation was computed. [2018-01-30 05:21:31,430 INFO L399 ceAbstractionStarter]: For program point L292(line 292) no Hoare annotation was computed. [2018-01-30 05:21:31,430 INFO L399 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2018-01-30 05:21:31,430 INFO L399 ceAbstractionStarter]: For program point L290(line 290) no Hoare annotation was computed. [2018-01-30 05:21:31,430 INFO L395 ceAbstractionStarter]: At program point L395(lines 395 412) the Hoare annotation is: (or (< |old(~myStatus)| 0) (= |old(~pended)| 1) (< |old(~compRegistered)| 0) (< 1 |old(~NP)|) (not (= |old(~lowerDriverReturn)| 0)) (< 0 |old(~compRegistered)|) (and (<= 0 ~compRegistered) (not (= ~pended 1)))) [2018-01-30 05:21:31,430 INFO L399 ceAbstractionStarter]: For program point L351(lines 351 366) no Hoare annotation was computed. [2018-01-30 05:21:31,430 INFO L399 ceAbstractionStarter]: For program point L293'(line 293) no Hoare annotation was computed. [2018-01-30 05:21:31,430 INFO L399 ceAbstractionStarter]: For program point L350(line 350) no Hoare annotation was computed. [2018-01-30 05:21:31,430 INFO L399 ceAbstractionStarter]: For program point L350'(line 350) no Hoare annotation was computed. [2018-01-30 05:21:31,430 INFO L399 ceAbstractionStarter]: For program point L311(line 311) no Hoare annotation was computed. [2018-01-30 05:21:31,430 INFO L395 ceAbstractionStarter]: At program point L399(line 399) the Hoare annotation is: (or (< |old(~myStatus)| 0) (= |old(~pended)| 1) (< |old(~compRegistered)| 0) (< 1 |old(~NP)|) (not (= |old(~lowerDriverReturn)| 0)) (< 0 |old(~compRegistered)|)) [2018-01-30 05:21:31,432 INFO L399 ceAbstractionStarter]: For program point L310(line 310) no Hoare annotation was computed. [2018-01-30 05:21:31,433 INFO L395 ceAbstractionStarter]: At program point L354(line 354) the Hoare annotation is: (or (< |old(~myStatus)| 0) (= |old(~pended)| 1) (<= 0 main_~status~86) (< |old(~compRegistered)| 0) (< 1 |old(~NP)|) (not (= |old(~lowerDriverReturn)| 0)) (< 0 |old(~compRegistered)|)) [2018-01-30 05:21:31,433 INFO L399 ceAbstractionStarter]: For program point L289'(line 289) no Hoare annotation was computed. [2018-01-30 05:21:31,433 INFO L399 ceAbstractionStarter]: For program point L397(lines 397 401) no Hoare annotation was computed. [2018-01-30 05:21:31,433 INFO L395 ceAbstractionStarter]: At program point L352(line 352) the Hoare annotation is: (or (< |old(~myStatus)| 0) (= |old(~pended)| 1) (and (<= (+ ~NP 4) ~MPR1) (= ~lowerDriverReturn 0) (<= 0 ~compRegistered) (<= 0 main_~status~86) (= ~s ~NP) (<= ~compRegistered 0) (= ~s 1) (not (= ~pended 1))) (< |old(~compRegistered)| 0) (< 1 |old(~NP)|) (not (= |old(~lowerDriverReturn)| 0)) (< 0 |old(~compRegistered)|)) [2018-01-30 05:21:31,433 INFO L399 ceAbstractionStarter]: For program point L315(line 315) no Hoare annotation was computed. [2018-01-30 05:21:31,433 INFO L399 ceAbstractionStarter]: For program point L314(line 314) no Hoare annotation was computed. [2018-01-30 05:21:31,433 INFO L399 ceAbstractionStarter]: For program point L358(line 358) no Hoare annotation was computed. [2018-01-30 05:21:31,433 INFO L399 ceAbstractionStarter]: For program point L313(line 313) no Hoare annotation was computed. [2018-01-30 05:21:31,433 INFO L399 ceAbstractionStarter]: For program point L293''(line 293) no Hoare annotation was computed. [2018-01-30 05:21:31,433 INFO L399 ceAbstractionStarter]: For program point L312(line 312) no Hoare annotation was computed. [2018-01-30 05:21:31,433 INFO L399 ceAbstractionStarter]: For program point L319(line 319) no Hoare annotation was computed. [2018-01-30 05:21:31,433 INFO L399 ceAbstractionStarter]: For program point L318(line 318) no Hoare annotation was computed. [2018-01-30 05:21:31,433 INFO L399 ceAbstractionStarter]: For program point L316(line 316) no Hoare annotation was computed. [2018-01-30 05:21:31,433 INFO L399 ceAbstractionStarter]: For program point L339'(lines 339 344) no Hoare annotation was computed. [2018-01-30 05:21:31,433 INFO L395 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 436 499) the Hoare annotation is: (let ((.cse1 (= ~lowerDriverReturn 0)) (.cse0 (= ~pended 1)) (.cse2 (not (= |old(~lowerDriverReturn)| 0)))) (and (or .cse0 (and .cse1 (= ~s ~SKIP1)) (not (= |old(~s)| ~SKIP1)) (< ~compRegistered 0) .cse2 (< 0 ~compRegistered)) (or (and .cse1 (= ~s 1)) (not (= |old(~s)| 1)) (= 259 ~compRegistered) .cse0 (< ~compRegistered 1) (not (= |old(~s)| ~NP)) .cse2 (< ~MPR1 (+ ~NP 4))))) [2018-01-30 05:21:31,433 INFO L399 ceAbstractionStarter]: For program point L483(line 483) no Hoare annotation was computed. [2018-01-30 05:21:31,433 INFO L399 ceAbstractionStarter]: For program point L492'(line 492) no Hoare annotation was computed. [2018-01-30 05:21:31,434 INFO L399 ceAbstractionStarter]: For program point L454''(line 454) no Hoare annotation was computed. [2018-01-30 05:21:31,434 INFO L399 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-01-30 05:21:31,434 INFO L399 ceAbstractionStarter]: For program point L480(line 480) no Hoare annotation was computed. [2018-01-30 05:21:31,434 INFO L399 ceAbstractionStarter]: For program point L440'(line 440) no Hoare annotation was computed. [2018-01-30 05:21:31,434 INFO L399 ceAbstractionStarter]: For program point L487(lines 487 494) no Hoare annotation was computed. [2018-01-30 05:21:31,434 INFO L399 ceAbstractionStarter]: For program point L441(line 441) no Hoare annotation was computed. [2018-01-30 05:21:31,434 INFO L399 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-01-30 05:21:31,434 INFO L399 ceAbstractionStarter]: For program point L454'(line 454) no Hoare annotation was computed. [2018-01-30 05:21:31,434 INFO L399 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-01-30 05:21:31,434 INFO L399 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 436 499) no Hoare annotation was computed. [2018-01-30 05:21:31,434 INFO L395 ceAbstractionStarter]: At program point L446(line 446) the Hoare annotation is: (let ((.cse0 (= ~pended 1)) (.cse1 (not (= |old(~lowerDriverReturn)| 0)))) (and (or .cse0 (not (= |old(~s)| ~SKIP1)) (< ~compRegistered 0) .cse1 (< 0 ~compRegistered)) (or (not (= |old(~s)| 1)) (= 259 ~compRegistered) (and (<= 1 ~setEventCalled) (<= ~setEventCalled 1) (= ~s 1) (= ~lowerDriverReturn 0)) .cse0 (< ~compRegistered 1) (not (= |old(~s)| ~NP)) .cse1 (< ~MPR1 (+ ~NP 4))))) [2018-01-30 05:21:31,434 INFO L399 ceAbstractionStarter]: For program point L489(line 489) no Hoare annotation was computed. [2018-01-30 05:21:31,434 INFO L395 ceAbstractionStarter]: At program point L445(line 445) the Hoare annotation is: (let ((.cse0 (= ~pended 1)) (.cse1 (not (= |old(~lowerDriverReturn)| 0)))) (and (or .cse0 (not (= |old(~s)| ~SKIP1)) (< ~compRegistered 0) .cse1 (< 0 ~compRegistered)) (or (and (= ~lowerDriverReturn 0) (= ~s 1)) (not (= |old(~s)| 1)) (= 259 ~compRegistered) .cse0 (< ~compRegistered 1) (not (= |old(~s)| ~NP)) .cse1 (< ~MPR1 (+ ~NP 4))))) [2018-01-30 05:21:31,434 INFO L399 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-01-30 05:21:31,434 INFO L399 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2018-01-30 05:21:31,434 INFO L399 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-01-30 05:21:31,434 INFO L399 ceAbstractionStarter]: For program point L445'(line 445) no Hoare annotation was computed. [2018-01-30 05:21:31,434 INFO L399 ceAbstractionStarter]: For program point L449'(line 449) no Hoare annotation was computed. [2018-01-30 05:21:31,435 INFO L399 ceAbstractionStarter]: For program point L450(lines 450 473) no Hoare annotation was computed. [2018-01-30 05:21:31,435 INFO L399 ceAbstractionStarter]: For program point L440''(line 440) no Hoare annotation was computed. [2018-01-30 05:21:31,435 INFO L395 ceAbstractionStarter]: At program point L470(line 470) the Hoare annotation is: (let ((.cse0 (= ~pended 1)) (.cse2 (= ~lowerDriverReturn 0)) (.cse3 (not (= |old(~lowerDriverReturn)| 0)))) (and (let ((.cse1 (= ~MPR1 ~s))) (or (not (= |old(~s)| 1)) (= 259 ~compRegistered) .cse0 (< ~compRegistered 1) (not (= |old(~s)| ~NP)) (and .cse1 .cse2 (<= 1 ~setEventCalled) (<= ~setEventCalled 1)) .cse3 (< ~MPR1 (+ ~NP 4)) (and .cse1 .cse2 (= 0 IofCallDriver_~returnVal2~129)))) (or .cse0 (and .cse2 (= ~s ~SKIP1)) (not (= |old(~s)| ~SKIP1)) (< ~compRegistered 0) .cse3 (< 0 ~compRegistered)))) [2018-01-30 05:21:31,435 INFO L395 ceAbstractionStarter]: At program point L492(line 492) the Hoare annotation is: (let ((.cse0 (= ~pended 1)) (.cse1 (not (= |old(~lowerDriverReturn)| 0)))) (and (or (not (= |old(~s)| 1)) (= 259 ~compRegistered) .cse0 (< ~compRegistered 1) (not (= |old(~s)| ~NP)) .cse1 (< ~MPR1 (+ ~NP 4))) (or .cse0 (not (= |old(~s)| ~SKIP1)) (< ~compRegistered 0) .cse1 (< 0 ~compRegistered)))) [2018-01-30 05:21:31,435 INFO L399 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-01-30 05:21:31,435 INFO L399 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-01-30 05:21:31,435 INFO L399 ceAbstractionStarter]: For program point L453(line 453) no Hoare annotation was computed. [2018-01-30 05:21:31,435 INFO L399 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-01-30 05:21:31,435 INFO L395 ceAbstractionStarter]: At program point L451(line 451) the Hoare annotation is: (let ((.cse0 (= ~pended 1)) (.cse2 (not (= |old(~lowerDriverReturn)| 0))) (.cse1 (= ~lowerDriverReturn 0))) (and (or .cse0 (and .cse1 (= ~s ~SKIP1)) (not (= |old(~s)| ~SKIP1)) (< ~compRegistered 0) .cse2 (< 0 ~compRegistered)) (or (not (= |old(~s)| 1)) (= 259 ~compRegistered) .cse0 (< ~compRegistered 1) (not (= |old(~s)| ~NP)) .cse2 (< ~MPR1 (+ ~NP 4)) (and (= ~MPR1 ~s) .cse1)))) [2018-01-30 05:21:31,435 INFO L399 ceAbstractionStarter]: For program point L436(lines 436 499) no Hoare annotation was computed. [2018-01-30 05:21:31,435 INFO L399 ceAbstractionStarter]: For program point L449''(line 449) no Hoare annotation was computed. [2018-01-30 05:21:31,435 INFO L395 ceAbstractionStarter]: At program point L458(line 458) the Hoare annotation is: (let ((.cse0 (= ~pended 1)) (.cse1 (= ~lowerDriverReturn 0)) (.cse2 (not (= |old(~lowerDriverReturn)| 0)))) (and (or (not (= |old(~s)| 1)) (= 259 ~compRegistered) .cse0 (< ~compRegistered 1) (not (= |old(~s)| ~NP)) (and (= ~MPR1 ~s) .cse1 (<= 1 ~setEventCalled) (<= ~setEventCalled 1)) .cse2 (< ~MPR1 (+ ~NP 4))) (or .cse0 (and .cse1 (= ~s ~SKIP1)) (not (= |old(~s)| ~SKIP1)) (< ~compRegistered 0) .cse2 (< 0 ~compRegistered)))) [2018-01-30 05:21:31,435 INFO L399 ceAbstractionStarter]: For program point L479(lines 479 485) no Hoare annotation was computed. [2018-01-30 05:21:31,435 INFO L399 ceAbstractionStarter]: For program point L478(lines 478 495) no Hoare annotation was computed. [2018-01-30 05:21:31,435 INFO L395 ceAbstractionStarter]: At program point L456(line 456) the Hoare annotation is: (let ((.cse0 (= ~pended 1)) (.cse1 (= ~lowerDriverReturn 0)) (.cse2 (not (= |old(~lowerDriverReturn)| 0)))) (and (or (not (= |old(~s)| 1)) (= 259 ~compRegistered) .cse0 (< ~compRegistered 1) (not (= |old(~s)| ~NP)) (and (= ~MPR1 ~s) .cse1 (<= 1 ~setEventCalled) (<= ~setEventCalled 1)) .cse2 (< ~MPR1 (+ ~NP 4))) (or .cse0 (and .cse1 (= ~s ~SKIP1)) (not (= |old(~s)| ~SKIP1)) (< ~compRegistered 0) .cse2 (< 0 ~compRegistered)))) [2018-01-30 05:21:31,435 INFO L399 ceAbstractionStarter]: For program point L455(lines 455 472) no Hoare annotation was computed. [2018-01-30 05:21:31,435 INFO L399 ceAbstractionStarter]: For program point L445''(line 445) no Hoare annotation was computed. [2018-01-30 05:21:31,436 INFO L399 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-01-30 05:21:31,436 INFO L399 ceAbstractionStarter]: For program point L438(line 438) no Hoare annotation was computed. [2018-01-30 05:21:31,436 INFO L399 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 436 499) no Hoare annotation was computed. [2018-01-30 05:21:31,436 INFO L399 ceAbstractionStarter]: For program point L445'''(line 445) no Hoare annotation was computed. [2018-01-30 05:21:31,436 INFO L399 ceAbstractionStarter]: For program point L444'(lines 444 447) no Hoare annotation was computed. [2018-01-30 05:21:31,436 INFO L399 ceAbstractionStarter]: For program point L430'(line 430) no Hoare annotation was computed. [2018-01-30 05:21:31,436 INFO L399 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 422 435) no Hoare annotation was computed. [2018-01-30 05:21:31,436 INFO L395 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (or (not (= |old(~s)| 1)) (= 259 ~compRegistered) (< ~setEventCalled 1) (= ~pended 1) (< ~compRegistered 1) (< 1 ~setEventCalled) (not (= |old(~s)| ~NP)) (not (= ~lowerDriverReturn 0)) (< ~MPR1 (+ ~NP 4))) [2018-01-30 05:21:31,436 INFO L395 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 422 435) the Hoare annotation is: (or (< ~setEventCalled 1) (= ~pended 1) (< ~MPR1 (+ ~NP 4)) (not (= |old(~s)| 1)) (= 259 ~compRegistered) (= ~s 1) (< ~compRegistered 1) (< 1 ~setEventCalled) (not (= |old(~s)| ~NP)) (not (= ~lowerDriverReturn 0))) [2018-01-30 05:21:31,436 INFO L399 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-01-30 05:21:31,436 INFO L399 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-30 05:21:31,436 INFO L399 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-01-30 05:21:31,436 INFO L399 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2018-01-30 05:21:31,436 INFO L399 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-01-30 05:21:31,436 INFO L399 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-01-30 05:21:31,436 INFO L399 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-01-30 05:21:31,436 INFO L399 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-01-30 05:21:31,436 INFO L399 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-01-30 05:21:31,436 INFO L399 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-01-30 05:21:31,436 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 583) the Hoare annotation is: (= ~s |old(~s)|) [2018-01-30 05:21:31,436 INFO L399 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-01-30 05:21:31,436 INFO L399 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-01-30 05:21:31,437 INFO L399 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-30 05:21:31,437 INFO L399 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-01-30 05:21:31,437 INFO L399 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-01-30 05:21:31,437 INFO L399 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-01-30 05:21:31,437 INFO L399 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-01-30 05:21:31,437 INFO L399 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-01-30 05:21:31,437 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 583) no Hoare annotation was computed. [2018-01-30 05:21:31,437 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 583) no Hoare annotation was computed. [2018-01-30 05:21:31,437 INFO L395 ceAbstractionStarter]: At program point L542(line 542) the Hoare annotation is: (let ((.cse1 (= 259 ~compRegistered)) (.cse0 (< |old(~setEventCalled)| 1)) (.cse2 (= ~pended 1)) (.cse3 (< ~compRegistered 1)) (.cse4 (< 1 |old(~setEventCalled)|)) (.cse5 (< ~MPR1 (+ ~NP 4)))) (and (or (not (= |old(~s)| 1)) .cse0 (or .cse1 .cse2 .cse3 (not (= |old(~s)| ~NP))) .cse4 .cse5) (or (< ~NP 1) .cse1 .cse0 .cse2 (not (= |old(~s)| ~MPR3)) .cse3 .cse4 (< 1 ~NP) .cse5))) [2018-01-30 05:21:31,437 INFO L399 ceAbstractionStarter]: For program point L540'(lines 540 544) no Hoare annotation was computed. [2018-01-30 05:21:31,437 INFO L395 ceAbstractionStarter]: At program point L552(line 552) the Hoare annotation is: (let ((.cse2 (= ~pended 1))) (let ((.cse1 (< |old(~setEventCalled)| 1)) (.cse0 (= 259 ~compRegistered)) (.cse3 (< ~compRegistered 1)) (.cse4 (< 1 |old(~setEventCalled)|)) (.cse5 (and (= ~s ~NP) (<= 1 ~compRegistered) (not .cse2))) (.cse6 (< ~MPR1 (+ ~NP 4)))) (and (or (< ~NP 1) .cse0 .cse1 .cse2 (not (= |old(~s)| ~MPR3)) .cse3 .cse4 .cse5 (< 1 ~NP) .cse6) (or (not (= |old(~s)| 1)) .cse1 (or .cse0 .cse2 .cse3 (not (= |old(~s)| ~NP))) .cse4 .cse5 .cse6)))) [2018-01-30 05:21:31,437 INFO L399 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-01-30 05:21:31,437 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 544) no Hoare annotation was computed. [2018-01-30 05:21:31,438 INFO L395 ceAbstractionStarter]: At program point L550(line 550) the Hoare annotation is: (let ((.cse2 (= ~pended 1))) (let ((.cse1 (< |old(~setEventCalled)| 1)) (.cse0 (= 259 ~compRegistered)) (.cse3 (< ~compRegistered 1)) (.cse4 (< 1 |old(~setEventCalled)|)) (.cse5 (and (= ~s ~NP) (<= 1 ~compRegistered) (not .cse2))) (.cse6 (< ~MPR1 (+ ~NP 4)))) (and (or (< ~NP 1) .cse0 .cse1 .cse2 (not (= |old(~s)| ~MPR3)) .cse3 .cse4 .cse5 (< 1 ~NP) .cse6) (or (not (= |old(~s)| 1)) .cse1 (or .cse0 .cse2 .cse3 (not (= |old(~s)| ~NP))) .cse4 .cse5 .cse6)))) [2018-01-30 05:21:31,438 INFO L395 ceAbstractionStarter]: At program point L535(lines 535 545) the Hoare annotation is: (let ((.cse1 (= 259 ~compRegistered)) (.cse0 (< |old(~setEventCalled)| 1)) (.cse2 (= ~pended 1)) (.cse3 (< ~compRegistered 1)) (.cse4 (< 1 |old(~setEventCalled)|)) (.cse5 (< ~MPR1 (+ ~NP 4)))) (and (or (not (= |old(~s)| 1)) .cse0 (= ~s ~NP) (or .cse1 .cse2 .cse3 (not (= |old(~s)| ~NP))) .cse4 .cse5) (or (< ~NP 1) .cse1 .cse0 .cse2 (not (= |old(~s)| ~MPR3)) .cse3 .cse4 (< 1 ~NP) .cse5))) [2018-01-30 05:21:31,438 INFO L399 ceAbstractionStarter]: For program point L522(lines 522 563) no Hoare annotation was computed. [2018-01-30 05:21:31,438 INFO L399 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 522 563) no Hoare annotation was computed. [2018-01-30 05:21:31,438 INFO L395 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 522 563) the Hoare annotation is: (let ((.cse1 (= 259 ~compRegistered)) (.cse0 (< |old(~setEventCalled)| 1)) (.cse2 (= ~pended 1)) (.cse3 (< ~compRegistered 1)) (.cse4 (< 1 |old(~setEventCalled)|)) (.cse5 (<= 1 ~setEventCalled)) (.cse6 (<= ~setEventCalled 1)) (.cse7 (< ~MPR1 (+ ~NP 4)))) (and (or (not (= |old(~s)| 1)) .cse0 (or .cse1 .cse2 .cse3 (not (= |old(~s)| ~NP))) .cse4 (and .cse5 .cse6 (= ~s 1)) .cse7) (or (< ~NP 1) .cse1 .cse0 .cse2 (not (= |old(~s)| ~MPR3)) .cse3 .cse4 (and .cse5 (= ~s ~MPR3) .cse6) (< 1 ~NP) .cse7))) [2018-01-30 05:21:31,438 INFO L399 ceAbstractionStarter]: For program point L528(lines 528 533) no Hoare annotation was computed. [2018-01-30 05:21:31,439 INFO L399 ceAbstractionStarter]: For program point L549(lines 549 561) no Hoare annotation was computed. [2018-01-30 05:21:31,439 INFO L399 ceAbstractionStarter]: For program point L527(lines 527 546) no Hoare annotation was computed. [2018-01-30 05:21:31,439 INFO L399 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-01-30 05:21:31,439 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-30 05:21:31,439 INFO L399 ceAbstractionStarter]: For program point L537(line 537) no Hoare annotation was computed. [2018-01-30 05:21:31,439 INFO L399 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-01-30 05:21:31,439 INFO L399 ceAbstractionStarter]: For program point L522'(lines 522 563) no Hoare annotation was computed. [2018-01-30 05:21:31,439 INFO L399 ceAbstractionStarter]: For program point L522''(lines 522 563) no Hoare annotation was computed. [2018-01-30 05:21:31,439 INFO L399 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 522 563) no Hoare annotation was computed. [2018-01-30 05:21:31,439 INFO L399 ceAbstractionStarter]: For program point L522'''(lines 522 563) no Hoare annotation was computed. [2018-01-30 05:21:31,439 INFO L399 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-30 05:21:31,439 INFO L399 ceAbstractionStarter]: For program point L548''(line 548) no Hoare annotation was computed. [2018-01-30 05:21:31,439 INFO L399 ceAbstractionStarter]: For program point L508'(line 508) no Hoare annotation was computed. [2018-01-30 05:21:31,439 INFO L395 ceAbstractionStarter]: At program point L508(line 508) the Hoare annotation is: (or (= ~pended 1) (< ~compRegistered 1) (not (= |old(~s)| ~NP))) [2018-01-30 05:21:31,439 INFO L399 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 500 513) no Hoare annotation was computed. [2018-01-30 05:21:31,439 INFO L399 ceAbstractionStarter]: For program point L500(lines 500 513) no Hoare annotation was computed. [2018-01-30 05:21:31,439 INFO L395 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 500 513) the Hoare annotation is: (or (= ~pended 1) (< ~compRegistered 1) (= ~s ~NP) (not (= |old(~s)| ~NP))) [2018-01-30 05:21:31,439 INFO L399 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-01-30 05:21:31,439 INFO L399 ceAbstractionStarter]: For program point L504(lines 504 510) no Hoare annotation was computed. [2018-01-30 05:21:31,440 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 583) the Hoare annotation is: true [2018-01-30 05:21:31,440 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 583) no Hoare annotation was computed. [2018-01-30 05:21:31,440 INFO L395 ceAbstractionStarter]: At program point L1(lines 1 583) the Hoare annotation is: (and (= ~lowerDriverReturn 0) (<= 0 ~compRegistered) (<= ~NP 1) (<= 0 ~myStatus) (<= ~compRegistered 0) (not (= ~pended 1))) [2018-01-30 05:21:31,440 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 583) no Hoare annotation was computed. [2018-01-30 05:21:31,440 INFO L395 ceAbstractionStarter]: At program point L186(lines 186 187) the Hoare annotation is: (let ((.cse0 (not (= |old(~s)| 1))) (.cse1 (= ~pended 1)) (.cse2 (< |old(~compRegistered)| 0)) (.cse3 (not (= |old(~s)| ~NP))) (.cse4 (not (= |old(~lowerDriverReturn)| 0))) (.cse5 (< ~MPR1 (+ ~NP 4))) (.cse6 (< 0 |old(~compRegistered)|))) (and (or (< |old(~myStatus)| 0) .cse0 .cse1 (<= 0 ~myStatus) .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (not (= ~compRegistered 259)) (<= 0 KbFilter_PnP_~status~15) (= ~s 1) (= ~lowerDriverReturn 0) (not (= 259 KbFilter_PnP_~status~15)) (<= 1 ~compRegistered))))) [2018-01-30 05:21:31,440 INFO L399 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2018-01-30 05:21:31,440 INFO L399 ceAbstractionStarter]: For program point L223(line 223) no Hoare annotation was computed. [2018-01-30 05:21:31,440 INFO L399 ceAbstractionStarter]: For program point L254'(line 254) no Hoare annotation was computed. [2018-01-30 05:21:31,440 INFO L395 ceAbstractionStarter]: At program point L102(line 102) the Hoare annotation is: (let ((.cse0 (not (= |old(~s)| 1))) (.cse1 (= ~pended 1)) (.cse2 (< |old(~compRegistered)| 0)) (.cse3 (not (= |old(~s)| ~NP))) (.cse4 (not (= |old(~lowerDriverReturn)| 0))) (.cse5 (< ~MPR1 (+ ~NP 4))) (.cse6 (< 0 |old(~compRegistered)|))) (and (or (< |old(~myStatus)| 0) .cse0 .cse1 (<= 0 ~myStatus) .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 (and (<= 0 ~compRegistered) (<= 0 KbFilter_PnP_~status~15) (= ~s 1) (= ~lowerDriverReturn 0) (not (= 259 KbFilter_PnP_~status~15)) (<= ~compRegistered 0)) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-01-30 05:21:31,440 INFO L399 ceAbstractionStarter]: For program point L101(lines 101 283) no Hoare annotation was computed. [2018-01-30 05:21:31,440 INFO L399 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-01-30 05:21:31,440 INFO L395 ceAbstractionStarter]: At program point L105(line 105) the Hoare annotation is: (or (not (= |old(~s)| 1)) (= ~pended 1) (< |old(~compRegistered)| 0) (not (= |old(~s)| ~NP)) (not (= |old(~lowerDriverReturn)| 0)) (< ~MPR1 (+ ~NP 4)) (< 0 |old(~compRegistered)|) (and (= ~lowerDriverReturn 0) (<= 0 ~compRegistered) (= ~s ~NP) (<= ~compRegistered 0))) [2018-01-30 05:21:31,440 INFO L399 ceAbstractionStarter]: For program point L241''(line 241) no Hoare annotation was computed. [2018-01-30 05:21:31,440 INFO L395 ceAbstractionStarter]: At program point L225(lines 225 226) the Hoare annotation is: (or (not (= |old(~s)| 1)) (= ~pended 1) (and (= ~lowerDriverReturn 0) (<= 0 ~compRegistered) (<= ~compRegistered 0) (= ~s ~SKIP1)) (< |old(~compRegistered)| 0) (not (= |old(~s)| ~NP)) (not (= |old(~lowerDriverReturn)| 0)) (< ~MPR1 (+ ~NP 4)) (< 0 |old(~compRegistered)|)) [2018-01-30 05:21:31,440 INFO L399 ceAbstractionStarter]: For program point L104(lines 104 282) no Hoare annotation was computed. [2018-01-30 05:21:31,440 INFO L399 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2018-01-30 05:21:31,441 INFO L395 ceAbstractionStarter]: At program point L108(line 108) the Hoare annotation is: (or (not (= |old(~s)| 1)) (= ~pended 1) (< |old(~compRegistered)| 0) (not (= |old(~s)| ~NP)) (not (= |old(~lowerDriverReturn)| 0)) (< ~MPR1 (+ ~NP 4)) (< 0 |old(~compRegistered)|) (and (= ~lowerDriverReturn 0) (<= 0 ~compRegistered) (= ~s ~NP) (<= ~compRegistered 0))) [2018-01-30 05:21:31,441 INFO L399 ceAbstractionStarter]: For program point L107(lines 107 281) no Hoare annotation was computed. [2018-01-30 05:21:31,441 INFO L395 ceAbstractionStarter]: At program point L193(lines 193 195) the Hoare annotation is: (let ((.cse5 (not (= ~compRegistered 259))) (.cse6 (<= 1 ~setEventCalled)) (.cse8 (<= 1 ~compRegistered)) (.cse7 (<= ~setEventCalled 1)) (.cse1 (= ~pended 1)) (.cse12 (+ ~NP 4))) (let ((.cse3 (< |old(~compRegistered)| 0)) (.cse10 (< ~MPR1 .cse12)) (.cse0 (not (= |old(~s)| 1))) (.cse2 (and (<= .cse12 ~MPR1) .cse5 .cse6 (= ~s ~NP) .cse8 .cse7 (= ~s 1) (not .cse1))) (.cse4 (not (= |old(~s)| ~NP))) (.cse9 (not (= |old(~lowerDriverReturn)| 0))) (.cse11 (< 0 |old(~compRegistered)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (<= 259 KbFilter_PnP_~status~15) .cse5 .cse6 (<= KbFilter_PnP_~__cil_tmp23~15 259) (= ~s ~MPR3) .cse7 (<= 259 KbFilter_PnP_~__cil_tmp23~15) (<= KbFilter_PnP_~status~15 259) .cse8) .cse9 .cse10 .cse11) (or (< |old(~myStatus)| 0) .cse1 .cse3 .cse10 .cse0 .cse2 .cse4 (<= 0 ~myStatus) .cse9 .cse11)))) [2018-01-30 05:21:31,441 INFO L399 ceAbstractionStarter]: For program point L239'(line 239) no Hoare annotation was computed. [2018-01-30 05:21:31,441 INFO L399 ceAbstractionStarter]: For program point L191(lines 191 197) no Hoare annotation was computed. [2018-01-30 05:21:31,441 INFO L399 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-01-30 05:21:31,441 INFO L399 ceAbstractionStarter]: For program point L175(lines 175 181) no Hoare annotation was computed. [2018-01-30 05:21:31,441 INFO L399 ceAbstractionStarter]: For program point L186'(lines 186 187) no Hoare annotation was computed. [2018-01-30 05:21:31,441 INFO L399 ceAbstractionStarter]: For program point L193''(lines 193 195) no Hoare annotation was computed. [2018-01-30 05:21:31,441 INFO L395 ceAbstractionStarter]: At program point L172(line 172) the Hoare annotation is: (or (not (= |old(~s)| 1)) (= ~pended 1) (< |old(~compRegistered)| 0) (not (= |old(~s)| ~NP)) (not (= |old(~lowerDriverReturn)| 0)) (< ~MPR1 (+ ~NP 4)) (< 0 |old(~compRegistered)|)) [2018-01-30 05:21:31,441 INFO L395 ceAbstractionStarter]: At program point L210(line 210) the Hoare annotation is: (or (not (= |old(~s)| 1)) (= ~pended 1) (and (= ~s ~NP) (<= 1 ~compRegistered)) (< |old(~compRegistered)| 0) (not (= |old(~s)| ~NP)) (not (= |old(~lowerDriverReturn)| 0)) (< ~MPR1 (+ ~NP 4)) (< 0 |old(~compRegistered)|)) [2018-01-30 05:21:31,441 INFO L395 ceAbstractionStarter]: At program point L177(line 177) the Hoare annotation is: (or (not (= |old(~s)| 1)) (= ~pended 1) (< |old(~compRegistered)| 0) (not (= |old(~s)| ~NP)) (not (= |old(~lowerDriverReturn)| 0)) (< ~MPR1 (+ ~NP 4)) (< 0 |old(~compRegistered)|)) [2018-01-30 05:21:31,441 INFO L399 ceAbstractionStarter]: For program point L255'(line 255) no Hoare annotation was computed. [2018-01-30 05:21:31,441 INFO L399 ceAbstractionStarter]: For program point L74(lines 74 286) no Hoare annotation was computed. [2018-01-30 05:21:31,441 INFO L399 ceAbstractionStarter]: For program point L216(line 216) no Hoare annotation was computed. [2018-01-30 05:21:31,441 INFO L399 ceAbstractionStarter]: For program point L215(lines 215 221) no Hoare annotation was computed. [2018-01-30 05:21:31,441 INFO L399 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-01-30 05:21:31,442 INFO L399 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-01-30 05:21:31,442 INFO L399 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-01-30 05:21:31,442 INFO L399 ceAbstractionStarter]: For program point L77(line 77) no Hoare annotation was computed. [2018-01-30 05:21:31,442 INFO L395 ceAbstractionStarter]: At program point L219(line 219) the Hoare annotation is: (or (not (= |old(~s)| 1)) (= ~pended 1) (< |old(~compRegistered)| 0) (not (= |old(~s)| ~NP)) (not (= |old(~lowerDriverReturn)| 0)) (< ~MPR1 (+ ~NP 4)) (< 0 |old(~compRegistered)|)) [2018-01-30 05:21:31,442 INFO L399 ceAbstractionStarter]: For program point L256''(lines 256 257) no Hoare annotation was computed. [2018-01-30 05:21:31,442 INFO L399 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-01-30 05:21:31,442 INFO L399 ceAbstractionStarter]: For program point L186''(lines 186 187) no Hoare annotation was computed. [2018-01-30 05:21:31,442 INFO L399 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-01-30 05:21:31,442 INFO L395 ceAbstractionStarter]: At program point L241(line 241) the Hoare annotation is: (or (not (= |old(~s)| 1)) (= ~pended 1) (and (= ~lowerDriverReturn 0) (<= 0 ~compRegistered) (<= ~compRegistered 0) (= ~s ~SKIP1)) (< |old(~compRegistered)| 0) (not (= |old(~s)| ~NP)) (not (= |old(~lowerDriverReturn)| 0)) (< ~MPR1 (+ ~NP 4)) (< 0 |old(~compRegistered)|)) [2018-01-30 05:21:31,442 INFO L399 ceAbstractionStarter]: For program point L80'(line 80) no Hoare annotation was computed. [2018-01-30 05:21:31,442 INFO L399 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2018-01-30 05:21:31,442 INFO L399 ceAbstractionStarter]: For program point L225''(lines 225 226) no Hoare annotation was computed. [2018-01-30 05:21:31,442 INFO L399 ceAbstractionStarter]: For program point KbFilter_PnPEXIT(lines 74 286) no Hoare annotation was computed. [2018-01-30 05:21:31,442 INFO L399 ceAbstractionStarter]: For program point L240'(line 240) no Hoare annotation was computed. [2018-01-30 05:21:31,442 INFO L399 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-01-30 05:21:31,442 INFO L399 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-01-30 05:21:31,442 INFO L399 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-01-30 05:21:31,442 INFO L399 ceAbstractionStarter]: For program point L122(lines 122 276) no Hoare annotation was computed. [2018-01-30 05:21:31,442 INFO L399 ceAbstractionStarter]: For program point L242(line 242) no Hoare annotation was computed. [2018-01-30 05:21:31,442 INFO L399 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-01-30 05:21:31,442 INFO L399 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-01-30 05:21:31,442 INFO L399 ceAbstractionStarter]: For program point L128(lines 128 274) no Hoare annotation was computed. [2018-01-30 05:21:31,442 INFO L399 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L247(line 247) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L240''(line 240) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L86(line 86) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L125(lines 125 275) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L89(line 89) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L225'(lines 225 226) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L186'''(lines 186 187) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L241'(line 241) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point KbFilter_PnPFINAL(lines 74 286) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L113(lines 113 279) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L88''(line 88) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L199(lines 199 205) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L110(lines 110 280) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L231(lines 231 237) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2018-01-30 05:21:31,443 INFO L399 ceAbstractionStarter]: For program point L116(lines 116 278) no Hoare annotation was computed. [2018-01-30 05:21:31,444 INFO L399 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2018-01-30 05:21:31,444 INFO L395 ceAbstractionStarter]: At program point L235(line 235) the Hoare annotation is: (or (not (= |old(~s)| 1)) (= ~pended 1) (< |old(~compRegistered)| 0) (not (= |old(~s)| ~NP)) (not (= |old(~lowerDriverReturn)| 0)) (< ~MPR1 (+ ~NP 4)) (< 0 |old(~compRegistered)|)) [2018-01-30 05:21:31,444 INFO L399 ceAbstractionStarter]: For program point L80''(line 80) no Hoare annotation was computed. [2018-01-30 05:21:31,444 INFO L399 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-01-30 05:21:31,444 INFO L399 ceAbstractionStarter]: For program point L119(lines 119 277) no Hoare annotation was computed. [2018-01-30 05:21:31,444 INFO L399 ceAbstractionStarter]: For program point L239(line 239) no Hoare annotation was computed. [2018-01-30 05:21:31,444 INFO L399 ceAbstractionStarter]: For program point L255''(line 255) no Hoare annotation was computed. [2018-01-30 05:21:31,444 INFO L399 ceAbstractionStarter]: For program point L88'(line 88) no Hoare annotation was computed. [2018-01-30 05:21:31,445 INFO L395 ceAbstractionStarter]: At program point KbFilter_PnPENTRY(lines 74 286) the Hoare annotation is: (let ((.cse0 (not (= |old(~s)| 1))) (.cse1 (= ~pended 1)) (.cse2 (< |old(~compRegistered)| 0)) (.cse3 (not (= |old(~s)| ~NP))) (.cse4 (not (= |old(~lowerDriverReturn)| 0))) (.cse5 (< ~MPR1 (+ ~NP 4))) (.cse6 (< 0 |old(~compRegistered)|))) (and (or (< |old(~myStatus)| 0) .cse0 .cse1 (<= 0 ~myStatus) .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 (and (= ~lowerDriverReturn 0) (<= 0 ~compRegistered) (<= ~compRegistered 0) (= ~s 1)) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-01-30 05:21:31,445 INFO L399 ceAbstractionStarter]: For program point L250'(line 250) no Hoare annotation was computed. [2018-01-30 05:21:31,446 INFO L399 ceAbstractionStarter]: For program point L224''(line 224) no Hoare annotation was computed. [2018-01-30 05:21:31,446 INFO L395 ceAbstractionStarter]: At program point L261(line 261) the Hoare annotation is: (or (not (= |old(~s)| 1)) (= ~pended 1) (< |old(~compRegistered)| 0) (not (= |old(~s)| ~NP)) (not (= |old(~lowerDriverReturn)| 0)) (< ~MPR1 (+ ~NP 4)) (< 0 |old(~compRegistered)|) (<= 0 ~compRegistered)) [2018-01-30 05:21:31,446 INFO L399 ceAbstractionStarter]: For program point L82'(line 82) no Hoare annotation was computed. [2018-01-30 05:21:31,446 INFO L399 ceAbstractionStarter]: For program point L140(lines 140 270) no Hoare annotation was computed. [2018-01-30 05:21:31,446 INFO L399 ceAbstractionStarter]: For program point L146(lines 146 268) no Hoare annotation was computed. [2018-01-30 05:21:31,446 INFO L399 ceAbstractionStarter]: For program point L78''(line 78) no Hoare annotation was computed. [2018-01-30 05:21:31,446 INFO L399 ceAbstractionStarter]: For program point L143(lines 143 269) no Hoare annotation was computed. [2018-01-30 05:21:31,446 INFO L399 ceAbstractionStarter]: For program point L149(lines 149 267) no Hoare annotation was computed. [2018-01-30 05:21:31,446 INFO L399 ceAbstractionStarter]: For program point L193'(lines 193 195) no Hoare annotation was computed. [2018-01-30 05:21:31,446 INFO L399 ceAbstractionStarter]: For program point L235'(line 235) no Hoare annotation was computed. [2018-01-30 05:21:31,446 INFO L399 ceAbstractionStarter]: For program point L79'(line 79) no Hoare annotation was computed. [2018-01-30 05:21:31,446 INFO L399 ceAbstractionStarter]: For program point L219'(line 219) no Hoare annotation was computed. [2018-01-30 05:21:31,446 INFO L399 ceAbstractionStarter]: For program point L191''(lines 191 197) no Hoare annotation was computed. [2018-01-30 05:21:31,446 INFO L399 ceAbstractionStarter]: For program point L131(lines 131 273) no Hoare annotation was computed. [2018-01-30 05:21:31,446 INFO L399 ceAbstractionStarter]: For program point L81'(line 81) no Hoare annotation was computed. [2018-01-30 05:21:31,446 INFO L395 ceAbstractionStarter]: At program point L250(line 250) the Hoare annotation is: (or (not (= |old(~s)| 1)) (= ~pended 1) (< |old(~compRegistered)| 0) (not (= |old(~s)| ~NP)) (not (= |old(~lowerDriverReturn)| 0)) (< ~MPR1 (+ ~NP 4)) (< 0 |old(~compRegistered)|)) [2018-01-30 05:21:31,446 INFO L395 ceAbstractionStarter]: At program point L256(lines 256 257) the Hoare annotation is: (or (not (= |old(~s)| 1)) (= ~pended 1) (and (= ~lowerDriverReturn 0) (<= 0 ~compRegistered) (<= ~compRegistered 0) (= ~s ~SKIP1)) (< |old(~compRegistered)| 0) (not (= |old(~s)| ~NP)) (not (= |old(~lowerDriverReturn)| 0)) (< ~MPR1 (+ ~NP 4)) (< 0 |old(~compRegistered)|)) [2018-01-30 05:21:31,446 INFO L399 ceAbstractionStarter]: For program point L255(line 255) no Hoare annotation was computed. [2018-01-30 05:21:31,446 INFO L399 ceAbstractionStarter]: For program point L134(lines 134 272) no Hoare annotation was computed. [2018-01-30 05:21:31,446 INFO L399 ceAbstractionStarter]: For program point L254(line 254) no Hoare annotation was computed. [2018-01-30 05:21:31,446 INFO L399 ceAbstractionStarter]: For program point L223'(line 223) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L137(lines 137 271) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L81''(line 81) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L224'(line 224) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L78'(line 78) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L395 ceAbstractionStarter]: At program point L164(line 164) the Hoare annotation is: (or (not (= |old(~s)| 1)) (= ~pended 1) (< |old(~compRegistered)| 0) (not (= |old(~s)| ~NP)) (not (= |old(~lowerDriverReturn)| 0)) (< ~MPR1 (+ ~NP 4)) (< 0 |old(~compRegistered)|) (and (= ~lowerDriverReturn 0) (<= 0 ~compRegistered) (= ~s ~NP) (<= ~compRegistered 0))) [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L175'(lines 175 181) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L161(lines 161 263) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L200(lines 200 204) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L256'(lines 256 257) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L79''(line 79) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L208(line 208) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L256'''(lines 256 257) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L170(lines 170 182) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L152(lines 152 266) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L155(lines 155 265) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L158(lines 158 264) no Hoare annotation was computed. [2018-01-30 05:21:31,447 INFO L399 ceAbstractionStarter]: For program point L82''(line 82) no Hoare annotation was computed. [2018-01-30 05:21:31,448 INFO L399 ceAbstractionStarter]: For program point L225'''(lines 225 226) no Hoare annotation was computed. [2018-01-30 05:21:31,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 05:21:31 BasicIcfg [2018-01-30 05:21:31,483 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 05:21:31,483 INFO L168 Benchmark]: Toolchain (without parser) took 13731.00 ms. Allocated memory was 151.5 MB in the beginning and 400.0 MB in the end (delta: 248.5 MB). Free memory was 116.4 MB in the beginning and 198.7 MB in the end (delta: -82.3 MB). Peak memory consumption was 256.3 MB. Max. memory is 5.3 GB. [2018-01-30 05:21:31,484 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 151.5 MB. Free memory is still 121.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 05:21:31,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.63 ms. Allocated memory is still 151.5 MB. Free memory was 116.2 MB in the beginning and 102.9 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-01-30 05:21:31,484 INFO L168 Benchmark]: Boogie Preprocessor took 48.61 ms. Allocated memory is still 151.5 MB. Free memory was 102.9 MB in the beginning and 100.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 05:21:31,484 INFO L168 Benchmark]: RCFGBuilder took 768.36 ms. Allocated memory is still 151.5 MB. Free memory was 100.9 MB in the beginning and 99.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 5.3 GB. [2018-01-30 05:21:31,485 INFO L168 Benchmark]: IcfgTransformer took 19.36 ms. Allocated memory is still 151.5 MB. Free memory was 98.5 MB in the beginning and 96.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 5.3 GB. [2018-01-30 05:21:31,485 INFO L168 Benchmark]: TraceAbstraction took 12749.73 ms. Allocated memory was 151.5 MB in the beginning and 400.0 MB in the end (delta: 248.5 MB). Free memory was 95.7 MB in the beginning and 198.7 MB in the end (delta: -103.0 MB). Peak memory consumption was 235.6 MB. Max. memory is 5.3 GB. [2018-01-30 05:21:31,486 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 151.5 MB. Free memory is still 121.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 142.63 ms. Allocated memory is still 151.5 MB. Free memory was 116.2 MB in the beginning and 102.9 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 48.61 ms. Allocated memory is still 151.5 MB. Free memory was 102.9 MB in the beginning and 100.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 768.36 ms. Allocated memory is still 151.5 MB. Free memory was 100.9 MB in the beginning and 99.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 5.3 GB. * IcfgTransformer took 19.36 ms. Allocated memory is still 151.5 MB. Free memory was 98.5 MB in the beginning and 96.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 12749.73 ms. Allocated memory was 151.5 MB in the beginning and 400.0 MB in the end (delta: 248.5 MB). Free memory was 95.7 MB in the beginning and 198.7 MB in the end (delta: -103.0 MB). Peak memory consumption was 235.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 470]: Loop Invariant Derived loop invariant: ((((((((!(\old(s) == 1) || 259 == compRegistered) || pended == 1) || compRegistered < 1) || !(\old(s) == NP)) || (((MPR1 == s && lowerDriverReturn == 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(\old(lowerDriverReturn) == 0)) || MPR1 < NP + 4) || ((MPR1 == s && lowerDriverReturn == 0) && 0 == returnVal2)) && (((((pended == 1 || (lowerDriverReturn == 0 && s == SKIP1)) || !(\old(s) == SKIP1)) || compRegistered < 0) || !(\old(lowerDriverReturn) == 0)) || 0 < compRegistered) - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: (((((((((NP < 1 || 259 == compRegistered) || \old(setEventCalled) < 1) || pended == 1) || !(\old(s) == MPR3)) || compRegistered < 1) || 1 < \old(setEventCalled)) || ((s == NP && 1 <= compRegistered) && !(pended == 1))) || 1 < NP) || MPR1 < NP + 4) && (((((!(\old(s) == 1) || \old(setEventCalled) < 1) || ((259 == compRegistered || pended == 1) || compRegistered < 1) || !(\old(s) == NP)) || 1 < \old(setEventCalled)) || ((s == NP && 1 <= compRegistered) && !(pended == 1))) || MPR1 < NP + 4) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((((((((NP < 1 || 259 == compRegistered) || \old(setEventCalled) < 1) || pended == 1) || !(\old(s) == MPR3)) || compRegistered < 1) || 1 < \old(setEventCalled)) || ((s == NP && 1 <= compRegistered) && !(pended == 1))) || 1 < NP) || MPR1 < NP + 4) && (((((!(\old(s) == 1) || \old(setEventCalled) < 1) || ((259 == compRegistered || pended == 1) || compRegistered < 1) || !(\old(s) == NP)) || 1 < \old(setEventCalled)) || ((s == NP && 1 <= compRegistered) && !(pended == 1))) || MPR1 < NP + 4) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: (((((\old(myStatus) < 0 || \old(pended) == 1) || \old(compRegistered) < 0) || 1 < \old(NP)) || !(\old(lowerDriverReturn) == 0)) || 0 < \old(compRegistered)) || (0 <= compRegistered && !(pended == 1)) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((((\old(myStatus) < 0 || \old(pended) == 1) || 0 <= status) || \old(compRegistered) < 0) || 1 < \old(NP)) || !(\old(lowerDriverReturn) == 0)) || 0 < \old(compRegistered) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((((\old(myStatus) < 0 || !(\old(s) == 1)) || pended == 1) || 0 <= myStatus) || \old(compRegistered) < 0) || !(\old(s) == NP)) || !(\old(lowerDriverReturn) == 0)) || MPR1 < NP + 4) || 0 < \old(compRegistered)) && (((((((!(\old(s) == 1) || pended == 1) || (((((0 <= compRegistered && 0 <= status) && s == 1) && lowerDriverReturn == 0) && !(259 == status)) && compRegistered <= 0)) || \old(compRegistered) < 0) || !(\old(s) == NP)) || !(\old(lowerDriverReturn) == 0)) || MPR1 < NP + 4) || 0 < \old(compRegistered)) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((!(\old(s) == 1) || pended == 1) || \old(compRegistered) < 0) || !(\old(s) == NP)) || !(\old(lowerDriverReturn) == 0)) || MPR1 < NP + 4) || 0 < \old(compRegistered)) || (((lowerDriverReturn == 0 && 0 <= compRegistered) && s == NP) && compRegistered <= 0) - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: (((((\old(myStatus) < 0 || \old(pended) == 1) || \old(compRegistered) < 0) || 1 < \old(NP)) || !(\old(lowerDriverReturn) == 0)) || 0 < \old(compRegistered)) || (0 <= compRegistered && !(pended == 1)) - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: (((((pended == 1 || (lowerDriverReturn == 0 && s == SKIP1)) || !(\old(s) == SKIP1)) || compRegistered < 0) || !(\old(lowerDriverReturn) == 0)) || 0 < compRegistered) && (((((((!(\old(s) == 1) || 259 == compRegistered) || pended == 1) || compRegistered < 1) || !(\old(s) == NP)) || !(\old(lowerDriverReturn) == 0)) || MPR1 < NP + 4) || (MPR1 == s && lowerDriverReturn == 0)) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((!(\old(s) == 1) || pended == 1) || \old(compRegistered) < 0) || !(\old(s) == NP)) || !(\old(lowerDriverReturn) == 0)) || MPR1 < NP + 4) || 0 < \old(compRegistered)) || (((lowerDriverReturn == 0 && 0 <= compRegistered) && s == NP) && compRegistered <= 0) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: (((((\old(myStatus) < 0 || \old(pended) == 1) || \old(compRegistered) < 0) || 1 < \old(NP)) || !(\old(lowerDriverReturn) == 0)) || 0 < \old(compRegistered)) || (0 <= compRegistered && !(pended == 1)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((!(\old(s) == 1) || pended == 1) || \old(compRegistered) < 0) || !(\old(s) == NP)) || !(\old(lowerDriverReturn) == 0)) || MPR1 < NP + 4) || 0 < \old(compRegistered)) || (((lowerDriverReturn == 0 && 0 <= compRegistered) && s == NP) && compRegistered <= 0) - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: (((((!(\old(s) == 1) || \old(setEventCalled) < 1) || s == NP) || ((259 == compRegistered || pended == 1) || compRegistered < 1) || !(\old(s) == NP)) || 1 < \old(setEventCalled)) || MPR1 < NP + 4) && ((((((((NP < 1 || 259 == compRegistered) || \old(setEventCalled) < 1) || pended == 1) || !(\old(s) == MPR3)) || compRegistered < 1) || 1 < \old(setEventCalled)) || 1 < NP) || MPR1 < NP + 4) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((((!(\old(s) == 1) || pended == 1) || \old(compRegistered) < 0) || !(\old(s) == NP)) || !(\old(lowerDriverReturn) == 0)) || MPR1 < NP + 4) || 0 < \old(compRegistered)) || 0 <= compRegistered - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: (((((((!(\old(s) == 1) || 259 == compRegistered) || pended == 1) || compRegistered < 1) || !(\old(s) == NP)) || (((MPR1 == s && lowerDriverReturn == 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(\old(lowerDriverReturn) == 0)) || MPR1 < NP + 4) && (((((pended == 1 || (lowerDriverReturn == 0 && s == SKIP1)) || !(\old(s) == SKIP1)) || compRegistered < 0) || !(\old(lowerDriverReturn) == 0)) || 0 < compRegistered) - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((((\old(myStatus) < 0 || \old(pended) == 1) || \old(compRegistered) < 0) || 1 < \old(NP)) || !(\old(lowerDriverReturn) == 0)) || 0 < \old(compRegistered)) || (0 <= compRegistered && !(pended == 1)) - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: (((((((!(\old(s) == 1) || 259 == compRegistered) || pended == 1) || compRegistered < 1) || !(\old(s) == NP)) || (((MPR1 == s && lowerDriverReturn == 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(\old(lowerDriverReturn) == 0)) || MPR1 < NP + 4) && (((((pended == 1 || (lowerDriverReturn == 0 && s == SKIP1)) || !(\old(s) == SKIP1)) || compRegistered < 0) || !(\old(lowerDriverReturn) == 0)) || 0 < compRegistered) - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 366 locations, 1 error locations. SAFE Result, 12.6s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 3.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 5221 SDtfs, 3254 SDslu, 8541 SDs, 0 SdLazy, 717 SolverSat, 186 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=692occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 105 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 53 LocationsWithAnnotation, 391 PreInvPairs, 471 NumberOfFragments, 2394 HoareAnnotationTreeSize, 391 FomulaSimplifications, 677 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 53 FomulaSimplificationsInter, 3889 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 3138 NumberOfCodeBlocks, 3138 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3122 ConstructedInterpolants, 0 QuantifiedInterpolants, 1030354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/kbfiltr_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_05-21-31-505.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/kbfiltr_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_05-21-31-505.csv Received shutdown request...